Question

Given the language $L=\{w\in\{a,b\}^*\mid\text{$w$ has an odd quantity of $a$ and even quantity of $b$}\}$ answer

score 47 · Answer 1 · 2026-03-25 22:06:16

47

Views

Given the language $L=\{w\in\{a,b\}^*\mid\text{$w$ has an odd quantity of $a$ and even quantity of $b$}\}$ answer

Published on 25 Mar 2026 - 22:06

score 23 · Answer 2 · 2026-03-25 23:38:16

23

Views

What do the regular expression operations + and . mean in the context of finite state automata?

Published on 25 Mar 2026 - 23:38

score 40 · Answer 3 · 2026-03-25 20:35:21

40

Views

Context-free grammar for the following language

Published on 25 Mar 2026 - 20:35

score 115 · Answer 4 · 2026-02-23 02:33:25

115

Views

Can a regular language be defined using recursive regular expressions?

Published on 23 Feb 2026 - 2:33

score 390 · Answer 5 · 2026-03-26 22:15:02

390

Views

Basic idea to show that the class of regular languages are closed under merging / modified shuffle

Published on 26 Mar 2026 - 22:15

score 100 · Answer 6 · 2019-12-14 15:21:43

100

Views

Is the theory of regular formal languages finitely axiomatizable?

Published on 14 Dec 2019 - 15:21

score 4.6k · Answer 7 · 2026-03-17 16:20:09

4.6k

Views

Equivalence of NFA with and without $\epsilon$-transitions.

Published on 17 Mar 2026 - 16:20

score 159 · Answer 8 · 2026-03-25 18:55:38

159

Views

An example of group which is regularly presented, but not finitely presented

Published on 25 Mar 2026 - 18:55

score 215 · Answer 9 · 2020-01-02 20:10:41

215

Views

How to show that a language is not regular using the Myhill-Nerode Theorem?

Published on 02 Jan 2020 - 20:10

score 40 · Answer 10 · 2020-01-09 16:57:06

40

Views

difference between $( a\cup b)^{}$ and $(a+b)^{}$

Published on 09 Jan 2020 - 16:57

score 56 · Answer 11 · 2026-03-25 04:38:01

56

Views

Show that the language $L$ is not regular

Published on 25 Mar 2026 - 4:38

score 145 · Answer 12 · 2026-03-27 05:15:53

145

Views

Converting a DFA to a regular expression

Published on 27 Mar 2026 - 5:15

score 950 · Answer 13 · 2026-03-26 01:01:37

950

Views

If we remove one string from any nonempty regular set, the resulting set is still regular.

Published on 26 Mar 2026 - 1:01

score 352 · Answer 14 · 2026-03-27 00:03:10

352

Views

Constructing an NFA given a language DF(A) = {a2...ak | a1a2... ak ∈ A}.

Published on 27 Mar 2026 - 0:03

score 479 · Answer 15 · 2026-03-27 00:10:11

479

Views

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

Published on 27 Mar 2026 - 0:10

List Question

Given the language $L=\{w\in\{a,b\}^*\mid\text{$w$ has an odd quantity of $a$ and even quantity of $b$}\}$ answer

What do the regular expression operations + and . mean in the context of finite state automata?

Context-free grammar for the following language

Can a regular language be defined using recursive regular expressions?

Basic idea to show that the class of regular languages are closed under merging / modified shuffle

Is the theory of regular formal languages finitely axiomatizable?

Equivalence of NFA with and without $\epsilon$-transitions.

An example of group which is regularly presented, but not finitely presented

How to show that a language is not regular using the Myhill-Nerode Theorem?

difference between $( a\cup b)^{}$ and $(a+b)^{}$

Show that the language $L$ is not regular

Converting a DFA to a regular expression

If we remove one string from any nonempty regular set, the resulting set is still regular.

Constructing an NFA given a language DF(A) = {a2...ak | a1a2... ak ∈ A}.

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

Trending Questions

Popular # Hahtags

Popular Questions