Question

Write a regular expressions for the set of strings over the alphabet Σ = {a, b} containing at least one a and at least one b.

score 11.4k · Answer 1 · 2026-05-10 12:54:49

11.4k

Views

Write a regular expressions for the set of strings over the alphabet Σ = {a, b} containing at least one a and at least one b.

Published on 10 May 2026 - 12:54

score 335 · Answer 2 · 2026-04-11 03:29:49

335

Views

How do I show that this DFA accepts this string?

Published on 11 Apr 2026 - 3:29

score 6.2k · Answer 3 · 2026-05-10 12:55:08

6.2k

Views

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

Published on 10 May 2026 - 12:55

score 5.1k · Answer 4 · 2026-04-16 01:45:31

5.1k

Views

Write a minimal DFA for the language $L = \{(ab)^n \mid n \geq 0\}$

Published on 16 Apr 2026 - 1:45

score 130 · Answer 5 · 2026-04-11 11:42:46

130

Views

DFA with 2 Alphabets

Published on 11 Apr 2026 - 11:42

score 55 · Answer 6 · 2026-05-10 12:51:54

55

Views

Context-Free Grammar / Automata

Published on 10 May 2026 - 12:51

score 692 · Answer 7 · 2026-04-12 15:40:51

692

Views

How to compare indices of a string with a Pushdown automata?

Published on 12 Apr 2026 - 15:40

score 182 · Answer 8 · 2026-04-12 08:30:02

182

Views

Does a finite state machine have to use all the input?

Published on 12 Apr 2026 - 8:30

score 267 · Answer 9 · 2026-05-10 12:53:07

267

Views

Pumping lemma: Convert pumped, binary string $xy^iz$to integer

Published on 10 May 2026 - 12:53

score 129 · Answer 10 · 2026-04-10 12:36:19

129

Views

Finding language accepted by a DFA

Published on 10 Apr 2026 - 12:36

score 64 · Answer 11 · 2026-05-10 12:50:25

64

Views

Generalizing Regular Expression from FAs

Published on 10 May 2026 - 12:50

score 70 · Answer 12 · 2026-04-11 09:26:28

70

Views

Regular properties of a graph

Published on 11 Apr 2026 - 9:26

score 1.5k · Answer 13 · 2026-04-20 13:27:08

1.5k

Views

Creating a deterministic Finite state machine that accepts even 1s parity

Published on 20 Apr 2026 - 13:27

score 363 · Answer 14 · 2026-05-10 12:52:58

363

Views

Design DFA for $ (a + b(ba)^)^b$

Published on 10 May 2026 - 12:52

score 291 · Answer 15 · 2026-04-10 10:40:29

291

Views

What is wrong with my application of the Myhill-Nerode theorem on this language?

Published on 10 Apr 2026 - 10:40

List Question

Write a regular expressions for the set of strings over the alphabet Σ = {a, b} containing at least one a and at least one b.

How do I show that this DFA accepts this string?

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

Write a minimal DFA for the language $L = \{(ab)^n \mid n \geq 0\}$

DFA with 2 Alphabets

Context-Free Grammar / Automata

How to compare indices of a string with a Pushdown automata?

Does a finite state machine have to use all the input?

Pumping lemma: Convert pumped, binary string $xy^iz$to integer

Finding language accepted by a DFA

Generalizing Regular Expression from FAs

Regular properties of a graph

Creating a deterministic Finite state machine that accepts even 1s parity

Design DFA for $ (a + b(ba)^)^b$

What is wrong with my application of the Myhill-Nerode theorem on this language?

Trending Questions

Popular # Hahtags

Popular Questions