Question

How can this all-NFA be converted to an DFA

score 204 · Answer 1 · 2022-02-14 18:49:56

204

Views

How can this all-NFA be converted to an DFA

Published on 14 Feb 2022 - 18:49

score 559 · Answer 2 · 2026-04-02 23:34:35

559

Views

Solution Verification: There exists an infinite set of different irregular languages such that their union is a regular language.

Published on 02 Apr 2026 - 23:34

score 64 · Answer 3 · 2022-02-15 07:33:18

64

Views

What type of Automata can accept just Theorems of Propositional Calculus

Published on 15 Feb 2022 - 7:33

score 1.3k · Answer 4 · 2026-04-02 23:28:55

1.3k

Views

Regular expression rules for union and concatenation with $\epsilon$ and $\emptyset$

Published on 02 Apr 2026 - 23:28

score 670 · Answer 5 · 2022-02-22 11:47:34

670

Views

DFA or NFA that accepts all words over the alphabet (a,b) that begins with ab and do not end with aa

Published on 22 Feb 2022 - 11:47

score 50 · Answer 6 · 2026-04-02 23:35:25

50

Views

Solution Verification: Prove or Disprove: If $L$ is an irregular language and $F$ is finite language, then $F\cap L^+$ is regular.

Published on 02 Apr 2026 - 23:35

score 592 · Answer 7 · 2026-03-28 12:12:40

592

Views

intersection of two regular expressions

Published on 28 Mar 2026 - 12:12

score 179 · Answer 8 · 2022-03-01 11:02:55

179

Views

Building a DFA from another DFA.

Published on 01 Mar 2022 - 11:02

score 209 · Answer 9 · 2022-03-03 02:16:36

209

Views

What is the transition function of the given NFA?

Published on 03 Mar 2022 - 2:16

score 169 · Answer 10 · 2026-03-28 12:13:33

169

Views

DFA conversion through state elimination and arden's method

Published on 28 Mar 2026 - 12:13

score 560 · Answer 11 · 2026-03-28 12:13:28

560

Views

$a^nb^n$ language vs $a^nb^m$

Published on 28 Mar 2026 - 12:13

score 861 · Answer 12 · 2022-03-04 08:01:18

861

Views

The number of states in DFA that accepts strings with length that is divisible by $3$ or $5$.

Published on 04 Mar 2022 - 8:01

score 2k · Answer 13 · 2026-03-25 20:09:36

2k

Views

a^m b^n c^n prove it's not regular/pumping lemma

Published on 25 Mar 2026 - 20:09

score 449 · Answer 14 · 2022-03-05 14:11:35

449

Views

How can I generate the DFA with following condition

Published on 05 Mar 2022 - 14:11

score 37 · Answer 15 · 2026-03-26 03:18:40

37

Views

constructing grammar for 101(1+0)*

Published on 26 Mar 2026 - 3:18

List Question

How can this all-NFA be converted to an DFA

Solution Verification: There exists an infinite set of different irregular languages such that their union is a regular language.

What type of Automata can accept just Theorems of Propositional Calculus

Regular expression rules for union and concatenation with $\epsilon$ and $\emptyset$

DFA or NFA that accepts all words over the alphabet (a,b) that begins with ab and do not end with aa

Solution Verification: Prove or Disprove: If $L$ is an irregular language and $F$ is finite language, then $F\cap L^+$ is regular.

intersection of two regular expressions

Building a DFA from another DFA.

What is the transition function of the given NFA?

DFA conversion through state elimination and arden's method

$a^nb^n$ language vs $a^nb^m$

The number of states in DFA that accepts strings with length that is divisible by $3$ or $5$.

a^m b^n c^n prove it's not regular/pumping lemma

How can I generate the DFA with following condition

constructing grammar for 101(1+0)*

Trending Questions

Popular # Hahtags

Popular Questions