Question

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

score 83 · Answer 1 · 2026-04-02 16:32:20

83

Views

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

Published on 02 Apr 2026 - 16:32

score 20 · Answer 2 · 2021-03-17 15:29:32

20

Views

Is there an automaton with the given properties?

Published on 17 Mar 2021 - 15:29

score 98 · Answer 3 · 2021-03-17 19:40:13

98

Views

Is set of words a regular language?

Published on 17 Mar 2021 - 19:40

score 63 · Answer 4 · 2021-03-22 02:37:42

63

Views

Design automata for these languages

Published on 22 Mar 2021 - 2:37

score 27 · Answer 5 · 2021-03-24 14:45:55

27

Views

How to avoid problems in modelchecking if we don't allow any $q_f \in F$?

Published on 24 Mar 2021 - 14:45

score 444 · Answer 6 · 2026-02-24 05:24:37

444

Views

This language is not context free but has a PDA?

Published on 24 Feb 2026 - 5:24

score 104 · Answer 7 · 2026-03-29 17:25:51

104

Views

Represent regular languages and automata having more than 26 symbols in their alphabet

Published on 29 Mar 2026 - 17:25

score 37 · Answer 8 · 2021-03-27 00:22:29

37

Views

Quantum Automata books

Published on 27 Mar 2021 - 0:22

score 436 · Answer 9 · 2026-03-28 08:49:34

436

Views

How to provide a regular grammar equivalent to context-free grammar?

Published on 28 Mar 2026 - 8:49

score 295 · Answer 10 · 2026-04-02 18:29:22

295

Views

How to build a DFA for the given language and prove its correctness?

Published on 02 Apr 2026 - 18:29

score 216 · Answer 11 · 2026-04-02 18:25:22

216

Views

Constructing a DFA for a language

Published on 02 Apr 2026 - 18:25

score 635 · Answer 12 · 2021-03-31 15:43:58

635

Views

Build a NFA that accepts $L_k=\{w\#w\quad |\quad w\in\{a,b\}^*,|w|=k\}$, where $\Sigma=\{a,b,\#\}$

Published on 31 Mar 2021 - 15:43

score 155 · Answer 13 · 2021-04-03 09:55:06

155

Views

Show that a set is one reducible to another given its m-reducible

Published on 03 Apr 2021 - 9:55

score 373 · Answer 14 · 2026-04-02 18:32:03

373

Views

Prove or disprove: Any infinite subset of the language L = {$a^nb^m$ | n = m or n = 2m} has to be non regular

Published on 02 Apr 2026 - 18:32

score 112 · Answer 15 · 2026-03-25 16:06:09

112

Views

Counterexample for minimal DFA proof

Published on 25 Mar 2026 - 16:06

List Question

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

Is there an automaton with the given properties?

Is set of words a regular language?

Design automata for these languages

How to avoid problems in modelchecking if we don't allow any $q_f \in F$?

This language is not context free but has a PDA?

Represent regular languages and automata having more than 26 symbols in their alphabet

Quantum Automata books

How to provide a regular grammar equivalent to context-free grammar?

How to build a DFA for the given language and prove its correctness?

Constructing a DFA for a language

Build a NFA that accepts $L_k=\{w\#w\quad |\quad w\in\{a,b\}^*,|w|=k\}$, where $\Sigma=\{a,b,\#\}$

Show that a set is one reducible to another given its m-reducible

Prove or disprove: Any infinite subset of the language L = {$a^nb^m$ | n = m or n = 2m} has to be non regular

Counterexample for minimal DFA proof

Trending Questions

Popular # Hahtags

Popular Questions