Question

The connection between regular languages and formal power series

score 50 · Answer 1 · 2023-03-15 02:05:10

50

Views

The connection between regular languages and formal power series

Published on 15 Mar 2023 - 2:05

score 2.4k · Answer 2 · 2026-03-25 10:53:34

2.4k

Views

Using pumping lemma show that language $L = \{a^{n^2} | n≥ 0\}$ is not regular.

Published on 25 Mar 2026 - 10:53

score 58 · Answer 3 · 2026-03-28 03:35:00

58

Views

Build automata for words with both "bab" and "abb"

Published on 28 Mar 2026 - 3:35

score 50 · Answer 4 · 2023-03-30 13:50:09

50

Views

regular languages and suffixes

Published on 30 Mar 2023 - 13:50

score 36 · Answer 5 · 2026-03-26 14:20:55

36

Views

Infinite number of regular exressions for a given language

Published on 26 Mar 2026 - 14:20

score 97 · Answer 6 · 2023-04-20 09:36:50

97

Views

Is Pumping lemma so useful? (Michael Sipser "Introduction to the Theory of Computation 3rd Edition")

Published on 20 Apr 2023 - 9:36

score 68 · Answer 7 · 2026-03-26 17:30:46

68

Views

Prove equivalence of two regex using basic identities.

Published on 26 Mar 2026 - 17:30

score 116 · Answer 8 · 2026-03-26 17:19:00

116

Views

How can I determine the language from a DFA?

Published on 26 Mar 2026 - 17:19

score 70 · Answer 9 · 2026-02-23 11:59:39

70

Views

Is the algorithmic problem for regular languages decidable?

Published on 23 Feb 2026 - 11:59

score 90 · Answer 10 · 2026-03-22 15:34:10

90

Views

Is the following language is regular, context free, and/or decidable?

Published on 22 Mar 2026 - 15:34

score 56 · Answer 11 · 2023-05-14 08:38:29

56

Views

Prove or disprove that L = {$a^nb^m$ | $m ≠ 3n + 5$} is a regular

Published on 14 May 2023 - 8:38

score 74 · Answer 12 · 2023-05-15 20:12:34

74

Views

Prove that L = {$w∈${a,b,c}$^*$|w contains "abc"} is regular with Nerode theorem?

Published on 15 May 2023 - 20:12

score 36 · Answer 13 · 2023-05-20 18:22:14

36

Views

prove using Nerode law that a language is regular

Published on 20 May 2023 - 18:22

score 75 · Answer 14 · 2026-03-25 10:53:34

75

Views

Proof that $L =$ {$a^p : \text{p is prime} $} is not regular

Published on 25 Mar 2026 - 10:53

score 51 · Answer 15 · 2023-06-02 07:48:59

51

Views

Let be a regular language. Prove all minimal automata for the language are isomorphic

Published on 02 Jun 2023 - 7:48

List Question

The connection between regular languages and formal power series

Using pumping lemma show that language $L = \{a^{n^2} | n≥ 0\}$ is not regular.

Build automata for words with both "bab" and "abb"

regular languages and suffixes

Infinite number of regular exressions for a given language

Is Pumping lemma so useful? (Michael Sipser "Introduction to the Theory of Computation 3rd Edition")

Prove equivalence of two regex using basic identities.

How can I determine the language from a DFA?

Is the algorithmic problem for regular languages decidable?

Is the following language is regular, context free, and/or decidable?

Prove or disprove that L = {$a^nb^m$ | $m ≠ 3n + 5$} is a regular

Prove that L = {$w∈${a,b,c}$^*$|w contains "abc"} is regular with Nerode theorem?

prove using Nerode law that a language is regular

Proof that $L =$ {$a^p : \text{p is prime} $} is not regular

Let be a regular language. Prove all minimal automata for the language are isomorphic

Trending Questions

Popular # Hahtags

Popular Questions