Question

Which of these strings does the included pushdown automaton recognize based on accepting states?

score 23 · Answer 1 · 2026-03-25 23:37:06

23

Views

Which of these strings does the included pushdown automaton recognize based on accepting states?

Published on 25 Mar 2026 - 23:37

score 58 · Answer 2 · 2020-04-07 11:19:46

58

Views

Right quotient of $a^baa^$ with $ab^*$

Published on 07 Apr 2020 - 11:19

score 51 · Answer 3 · 2026-03-25 16:02:20

51

Views

Which part of the string $00011112222$ can be pumped?

Published on 25 Mar 2026 - 16:02

score 93 · Answer 4 · 2026-03-25 22:04:05

93

Views

Keeping track of two different counters with a single stack, needed in recognizing the language $\mathcal L = \{0^m1^n \mid m \leq n \leq 2m\}$

Published on 25 Mar 2026 - 22:04

score 83 · Answer 5 · 2026-03-25 22:04:29

83

Views

Is $\mathcal L_1 \cup \mathcal L_2$ a DCFL, if and only if $\mathcal L_1 \cap \mathcal L_2$ is a DCFL?

Published on 25 Mar 2026 - 22:04

score 1.2k · Answer 6 · 2026-03-27 14:02:30

1.2k

Views

Prove that a class of regular languages is closed under an operation

Published on 27 Mar 2026 - 14:02

score 319 · Answer 7 · 2026-03-22 20:00:39

319

Views

Generating a finite state machine from regular grammar

Published on 22 Mar 2026 - 20:00

score 3.1k · Answer 8 · 2026-03-26 09:26:17

3.1k

Views

Is a language $L$ recursive, if it and its complement $L^c$ are both recursively enumerable?

Published on 26 Mar 2026 - 9:26

score 67 · Answer 9 · 2026-03-26 09:19:54

67

Views

A multiple choice on formal languages, Turing machines and automata

Published on 26 Mar 2026 - 9:19

score 594 · Answer 10 · 2026-03-27 05:36:30

594

Views

Constructing finite automata for a language

Published on 27 Mar 2026 - 5:36

score 157 · Answer 11 · 2020-04-20 09:37:44

157

Views

Length of the well formed formula $(((p_0)\rightarrow ((p_1)∧(p_{32}))) \rightarrow ((((p_{13})∧(p_6))∨(p_{317})) \rightarrow (p_{26})))$

Published on 20 Apr 2020 - 9:37

score 288 · Answer 12 · 2026-03-27 07:13:13

288

Views

union of regular language and non regular language

Published on 27 Mar 2026 - 7:13

score 50 · Answer 13 · 2026-03-26 03:11:38

50

Views

equivalence of regular expression: $L(\alpha\emptyset) = L(\emptyset)$

Published on 26 Mar 2026 - 3:11

score 56 · Answer 14 · 2020-04-30 00:08:01

56

Views

How do I use the Pumping Lemma with length to prove that the a language is nonregular?

Published on 30 Apr 2020 - 0:08

score 81 · Answer 15 · 2020-05-01 21:15:29

81

Views

Are strings of length $n^2$ sparse?

Published on 01 May 2020 - 21:15

List Question

Which of these strings does the included pushdown automaton recognize based on accepting states?

Right quotient of $a^baa^$ with $ab^*$

Which part of the string $00011112222$ can be pumped?

Keeping track of two different counters with a single stack, needed in recognizing the language $\mathcal L = \{0^m1^n \mid m \leq n \leq 2m\}$

Is $\mathcal L_1 \cup \mathcal L_2$ a DCFL, if and only if $\mathcal L_1 \cap \mathcal L_2$ is a DCFL?

Prove that a class of regular languages is closed under an operation

Generating a finite state machine from regular grammar

Is a language $L$ recursive, if it and its complement $L^c$ are both recursively enumerable?

A multiple choice on formal languages, Turing machines and automata

Constructing finite automata for a language

Length of the well formed formula $(((p_0)\rightarrow ((p_1)∧(p_{32}))) \rightarrow ((((p_{13})∧(p_6))∨(p_{317})) \rightarrow (p_{26})))$

union of regular language and non regular language

equivalence of regular expression: $L(\alpha\emptyset) = L(\emptyset)$

How do I use the Pumping Lemma with length to prove that the a language is nonregular?

Are strings of length $n^2$ sparse?

Trending Questions

Popular # Hahtags

Popular Questions