Question

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\}$

score 93 · Answer 1 · 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 72 · Answer 2 · 2020-04-08 21:25:37

72

Views

Proving that $\{a^n b^2 a^n \mid n\ge 0\}$ is a regular language

Published on 08 Apr 2020 - 21:25

score 83 · Answer 3 · 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 64 · Answer 4 · 2020-04-10 16:58:44

64

Views

Constructing an NFA

Published on 10 Apr 2020 - 16:58

score 60 · Answer 5 · 2020-04-13 21:15:52

60

Views

Monadic Second-order Logic of 2 Successors and Binary Tree Automata

Published on 13 Apr 2020 - 21:15

score 319 · Answer 6 · 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 7 · 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 8 · 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 593 · Answer 9 · 2020-04-19 08:53:23

593

Views

Constructing finite automata for a language

Published on 19 Apr 2020 - 8:53

score 138 · Answer 10 · 2026-02-23 02:54:21

138

Views

A basic transition automaton of ECA 30

Published on 23 Feb 2026 - 2:54

score 131 · Answer 11 · 2020-04-23 10:34:34

131

Views

What is the reason for the / in M/≈

Published on 23 Apr 2020 - 10:34

score 4.4k · Answer 12 · 2026-03-25 23:36:21

4.4k

Views

context free grammar that generates binary all numbers divisible by 3

Published on 25 Mar 2026 - 23:36

score 287 · Answer 13 · 2020-04-24 21:57:03

287

Views

union of regular language and non regular language

Published on 24 Apr 2020 - 21:57

score 825 · Answer 14 · 2026-03-25 06:01:40

825

Views

pumping lemma - union of regular languages

Published on 25 Mar 2026 - 6:01

score 73 · Answer 15 · 2026-03-25 08:09:22

73

Views

Find all traces satisfying a set of linear temporal logic (LTL) formulas

Published on 25 Mar 2026 - 8:09

List Question

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\}$

Proving that $\{a^n b^2 a^n \mid n\ge 0\}$ is a regular language

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

Constructing an NFA

Monadic Second-order Logic of 2 Successors and Binary Tree Automata

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

A basic transition automaton of ECA 30

What is the reason for the / in M/≈

context free grammar that generates binary all numbers divisible by 3

union of regular language and non regular language

pumping lemma - union of regular languages

Find all traces satisfying a set of linear temporal logic (LTL) formulas

Trending Questions

Popular # Hahtags

Popular Questions