Question

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

score 107 · Answer 1 · 2026-03-25 06:04:22

107

Views

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

Published on 25 Mar 2026 - 6:04

score 13.2k · Answer 2 · 2026-03-26 06:33:48

13.2k

Views

Is the set of regular languages closed under set difference?

Published on 26 Mar 2026 - 6:33

score 492 · Answer 3 · 2026-03-27 13:20:03

492

Views

Decide whether a non deterministic Büchi automata recognizes deterministic $\omega$ reg. language

Published on 27 Mar 2026 - 13:20

score 2k · Answer 4 · 2026-03-25 06:07:15

2k

Views

Can I prove, using Pumping Lemma, that $L=\{ a^i b^j a^j b^k | i,j,k \ge 1 \}$ is not a regular language?

Published on 25 Mar 2026 - 6:07

score 174 · Answer 5 · 2026-03-26 06:26:39

174

Views

Decide if a language is regular

Published on 26 Mar 2026 - 6:26

score 32 · Answer 6 · 2016-09-15 01:55:29

32

Views

Programming Languages: Pumping theorem(regular lang) walk through

Published on 15 Sep 2016 - 1:55

score 62 · Answer 7 · 2016-09-16 00:43:33

62

Views

Find three nonempty languages, $X, Y$ and $Z$ such that $XZ ⊆ YZ$, but $X$ is not a subset of $Y$.

Published on 16 Sep 2016 - 0:43

score 5.8k · Answer 8 · 2026-03-27 11:46:56

5.8k

Views

Let L be the set of strings over {a, b} generated by the recursive definition:

Published on 27 Mar 2026 - 11:46

score 60 · Answer 9 · 2016-09-20 02:35:22

60

Views

Find the languages that can represent the equivalence classes

Published on 20 Sep 2016 - 2:35

score 4.8k · Answer 10 · 2026-03-26 06:29:44

4.8k

Views

Identify the set of strings of odd length over {a, b} that contain the substring bb

Published on 26 Mar 2026 - 6:29

score 25k · Answer 11 · 2026-03-26 06:27:41

25k

Views

Finding the set of strings over $\{a, b\}$ that do not contain the substring aaa

Published on 26 Mar 2026 - 6:27

score 135 · Answer 12 · 2026-03-25 11:12:25

135

Views

formal grammar from automaton

Published on 25 Mar 2026 - 11:12

score 68 · Answer 13 · 2026-03-25 12:53:28

68

Views

Making the difference of a Non-Finite Deterministic Automaton.

Published on 25 Mar 2026 - 12:53

score 412 · Answer 14 · 2026-03-27 13:20:09

412

Views

Convert NFA Diagram to DFA

Published on 27 Mar 2026 - 13:20

score 144 · Answer 15 · 2026-03-27 13:19:58

144

Views

Design a NFA using a DFA that accepts a language A

Published on 27 Mar 2026 - 13:19

List Question

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

Is the set of regular languages closed under set difference?

Decide whether a non deterministic Büchi automata recognizes deterministic $\omega$ reg. language

Can I prove, using Pumping Lemma, that $L=\{ a^i b^j a^j b^k | i,j,k \ge 1 \}$ is not a regular language?

Decide if a language is regular

Programming Languages: Pumping theorem(regular lang) walk through

Find three nonempty languages, $X, Y$ and $Z$ such that $XZ ⊆ YZ$, but $X$ is not a subset of $Y$.

Let L be the set of strings over {a, b} generated by the recursive definition:

Find the languages that can represent the equivalence classes

Identify the set of strings of odd length over {a, b} that contain the substring bb

Finding the set of strings over $\{a, b\}$ that do not contain the substring aaa

formal grammar from automaton

Making the difference of a Non-Finite Deterministic Automaton.

Convert NFA Diagram to DFA

Design a NFA using a DFA that accepts a language A

Trending Questions

Popular # Hahtags

Popular Questions