Question

Give the context-free grammar that generates the pushdown automaton language

score 143 · Answer 1 · 2026-03-29 12:24:36

143

Views

Give the context-free grammar that generates the pushdown automaton language

Published on 29 Mar 2026 - 12:24

score 97 · Answer 2 · 2026-04-02 13:18:07

97

Views

Proving a language is regular through the reverse language

Published on 02 Apr 2026 - 13:18

score 249 · Answer 3 · 2026-03-29 12:28:01

249

Views

$L=(\{ca^nb^n | n \geq 0\} \cup \{a^nb^{2n } | n \geq 0\})^*$ is not dcfl. Why?

Published on 29 Mar 2026 - 12:28

score 77 · Answer 4 · 2020-11-13 14:27:01

77

Views

Critique my PDA for this language

Published on 13 Nov 2020 - 14:27

score 37 · Answer 5 · 2020-11-14 17:28:24

37

Views

How can I show that the set of decimal representations of the natural numbers divisible by4 is regular?

Published on 14 Nov 2020 - 17:28

score 304 · Answer 6 · 2026-03-29 12:25:39

304

Views

Show that this language is context-free by giving a pushdown automaton

Published on 29 Mar 2026 - 12:25

score 340 · Answer 7 · 2026-02-24 05:23:20

340

Views

draw the pushdown automaton

Published on 24 Feb 2026 - 5:23

score 234 · Answer 8 · 2026-03-26 02:48:57

234

Views

Prove that if $z^n$ is a palindrome for some $n>0$, then $z$ is also a palindrome for any alphabet E.

Published on 26 Mar 2026 - 2:48

score 440 · Answer 9 · 2026-03-28 05:22:06

440

Views

Need help in converting this Regular Expression to Epsilon NFA

Published on 28 Mar 2026 - 5:22

score 2.4k · Answer 10 · 2020-11-30 19:28:31

2.4k

Views

how can I prove that if I have a regular language L, that L' is a regular language

Published on 30 Nov 2020 - 19:28

score 127 · Answer 11 · 2026-02-23 22:51:42

127

Views

Why is it enough to test only the words up to length n ( number of state) in the given algorithm for a decidability problem

Published on 23 Feb 2026 - 22:51

score 194 · Answer 12 · 2026-03-29 14:07:13

194

Views

Is $L=\{\,a^ib^jc^k \mid i=2j=3k\, \}$ a Turing language?

Published on 29 Mar 2026 - 14:07

score 50 · Answer 13 · 2020-12-08 21:43:13

50

Views

What is the minimum DFA of this?

Published on 08 Dec 2020 - 21:43

score 98 · Answer 14 · 2026-04-02 13:09:57

98

Views

Converting DFA to Regex

Published on 02 Apr 2026 - 13:09

score 290 · Answer 15 · 2020-12-11 01:24:19

290

Views

NFA to DFA: new initial state

Published on 11 Dec 2020 - 1:24

List Question

Give the context-free grammar that generates the pushdown automaton language

Proving a language is regular through the reverse language

$L=(\{ca^nb^n | n \geq 0\} \cup \{a^nb^{2n } | n \geq 0\})^*$ is not dcfl. Why?

Critique my PDA for this language

How can I show that the set of decimal representations of the natural numbers divisible by4 is regular?

Show that this language is context-free by giving a pushdown automaton

draw the pushdown automaton

Prove that if $z^n$ is a palindrome for some $n>0$, then $z$ is also a palindrome for any alphabet E.

Need help in converting this Regular Expression to Epsilon NFA

how can I prove that if I have a regular language L, that L' is a regular language

Why is it enough to test only the words up to length n ( number of state) in the given algorithm for a decidability problem

Is $L=\{\,a^ib^jc^k \mid i=2j=3k\, \}$ a Turing language?

What is the minimum DFA of this?

Converting DFA to Regex

NFA to DFA: new initial state

Trending Questions

Popular # Hahtags

Popular Questions