Question

Find, if possible, a finite automaton that recognizes $L(G) = 0^(1022^ + 2(00)^*)$

score 92 · Answer 1 · 2026-03-25 19:05:11

92

Views

Find, if possible, a finite automaton that recognizes $L(G) = 0^(1022^ + 2(00)^*)$

Published on 25 Mar 2026 - 19:05

score 55 · Answer 2 · 2019-11-07 06:56:17

55

Views

Why is ε included as a step in NFA construction?

Published on 07 Nov 2019 - 6:56

score 57 · Answer 3 · 2019-11-09 15:21:42

57

Views

Can an automaton be produced for a language that outputs undefined for the empty string?

Published on 09 Nov 2019 - 15:21

score 323 · Answer 4 · 2026-03-25 19:04:10

323

Views

Is the infinite union of regular languages context free?

Published on 25 Mar 2026 - 19:04

score 413 · Answer 5 · 2026-03-22 08:30:39

413

Views

Transition function of non deterministic pushdown automata

Published on 22 Mar 2026 - 8:30

score 271 · Answer 6 · 2019-11-15 14:08:56

271

Views

Need clarification on the way a set former is written

Published on 15 Nov 2019 - 14:08

score 320 · Answer 7 · 2019-11-19 08:22:50

320

Views

the set of all strings of 0's and 1's that are not of the form ww^R

Published on 19 Nov 2019 - 8:22

score 30 · Answer 8 · 2026-03-25 23:38:24

30

Views

How to prove that $q_1=xq_1+yq_1+\lambda$ is equal to $q_1=(x+y)^*$

Published on 25 Mar 2026 - 23:38

score 121 · Answer 9 · 2019-11-22 20:30:22

121

Views

Prove Finite Language

Published on 22 Nov 2019 - 20:30

score 93 · Answer 10 · 2026-03-25 23:35:53

93

Views

Creating DFAs from REGEX

Published on 25 Mar 2026 - 23:35

score 725 · Answer 11 · 2019-11-30 15:57:11

725

Views

Prof that exist an L regular language L1,L2,L3... are non-regular sub languages of L & L1⊆L2⊆L3...

Published on 30 Nov 2019 - 15:57

score 52 · Answer 12 · 2026-03-25 19:01:08

52

Views

Finding Context free grammar for L

Published on 25 Mar 2026 - 19:01

score 60 · Answer 13 · 2026-03-25 19:01:28

60

Views

Context free grammar for $L$

Published on 25 Mar 2026 - 19:01

score 64 · Answer 14 · 2019-12-01 19:48:39

64

Views

Finding minimal DFA for language

Published on 01 Dec 2019 - 19:48

score 23 · Answer 15 · 2026-03-25 22:05:43

23

Views

Find automata for $S\to01X\mid0S,\;X\to2X\mid1Y,\;Y\to2Y2\mid0$

Published on 25 Mar 2026 - 22:05

List Question

Find, if possible, a finite automaton that recognizes $L(G) = 0^(1022^ + 2(00)^*)$

Why is ε included as a step in NFA construction?

Can an automaton be produced for a language that outputs undefined for the empty string?

Is the infinite union of regular languages context free?

Transition function of non deterministic pushdown automata

Need clarification on the way a set former is written

the set of all strings of 0's and 1's that are not of the form ww^R

How to prove that $q_1=xq_1+yq_1+\lambda$ is equal to $q_1=(x+y)^*$

Prove Finite Language

Creating DFAs from REGEX

Prof that exist an L regular language L1,L2,L3... are non-regular sub languages of L & L1⊆L2⊆L3...

Finding Context free grammar for L

Context free grammar for $L$

Finding minimal DFA for language

Find automata for $S\to01X\mid0S,\;X\to2X\mid1Y,\;Y\to2Y2\mid0$

Trending Questions

Popular # Hahtags

Popular Questions