Question

Can number of states of minimum accepting automaton be equal to a constan from the pumping lemma?

score 99 · Answer 1 · 2026-03-25 20:11:53

99

Views

Can number of states of minimum accepting automaton be equal to a constan from the pumping lemma?

Published on 25 Mar 2026 - 20:11

score 441 · Answer 2 · 2026-04-03 09:24:51

441

Views

Describe the language accepted by the DFA in set notation.

Published on 03 Apr 2026 - 9:24

score 282 · Answer 3 · 2021-04-08 16:02:03

282

Views

Construct an NFA that accepts $L=\{x\#y \mid x,y\in\{0,1\}^k,x\not=y\}$

Published on 08 Apr 2021 - 16:02

score 50 · Answer 4 · 2026-03-29 15:32:15

50

Views

Converting CFG with 4 letters to CNF

Published on 29 Mar 2026 - 15:32

score 94 · Answer 5 · 2026-02-24 00:39:37

94

Views

Subtile misunderstanding about Recognizable vs Decidable

Published on 24 Feb 2026 - 0:39

score 73 · Answer 6 · 2021-04-12 13:03:11

73

Views

What does epsilon mean here?

Published on 12 Apr 2021 - 13:03

score 275 · Answer 7 · 2026-03-25 20:08:02

275

Views

Prove the following languages are irregular.

Published on 25 Mar 2026 - 20:08

score 2.6k · Answer 8 · 2021-04-13 17:22:28

2.6k

Views

How to prove that the language $L = \{a^nb^mc^n | m, n ≥ 0\}$ is not regular using pumping lemma?

Published on 13 Apr 2021 - 17:22

score 6.2k · Answer 9 · 2021-04-13 20:15:26

6.2k

Views

Automaton NFA that include substring "aa" and "bb"

Published on 13 Apr 2021 - 20:15

score 193 · Answer 10 · 2026-03-28 08:50:09

193

Views

What is the easiest way to determine the list of all strings up to length N accepted by DFA or regular expression?

Published on 28 Mar 2026 - 8:50

score 26 · Answer 11 · 2026-04-02 18:27:21

26

Views

Why is this map, considered in the proof of a proposition about commutative equivalence, injective?

Published on 02 Apr 2026 - 18:27

score 26 · Answer 12 · 2021-04-17 18:29:38

26

Views

Find the count of all Brzozowski's derivatives of a given language

Published on 17 Apr 2021 - 18:29

score 89 · Answer 13 · 2026-04-02 18:25:37

89

Views

Proving a given language is not regular

Published on 02 Apr 2026 - 18:25

score 53 · Answer 14 · 2021-04-19 19:57:19

53

Views

Creating an equivalent DFA for this NFA

Published on 19 Apr 2021 - 19:57

score 396 · Answer 15 · 2021-04-20 19:19:54

396

Views

$L' = \{x\#y $ | $xy \in L, yx \notin L\} $ where $L$ is regular, Prove $L'$ is regular.

Published on 20 Apr 2021 - 19:19

List Question

Can number of states of minimum accepting automaton be equal to a constan from the pumping lemma?

Describe the language accepted by the DFA in set notation.

Construct an NFA that accepts $L=\{x\#y \mid x,y\in\{0,1\}^k,x\not=y\}$

Converting CFG with 4 letters to CNF

Subtile misunderstanding about Recognizable vs Decidable

What does epsilon mean here?

Prove the following languages are irregular.

How to prove that the language $L = \{a^nb^mc^n | m, n ≥ 0\}$ is not regular using pumping lemma?

Automaton NFA that include substring "aa" and "bb"

What is the easiest way to determine the list of all strings up to length N accepted by DFA or regular expression?

Why is this map, considered in the proof of a proposition about commutative equivalence, injective?

Find the count of all Brzozowski's derivatives of a given language

Proving a given language is not regular

Creating an equivalent DFA for this NFA

$L' = \{x\#y $ | $xy \in L, yx \notin L\} $ where $L$ is regular, Prove $L'$ is regular.

Trending Questions

Popular # Hahtags

Popular Questions