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 · 2018-04-12 04:25:35

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 12 Apr 2018 - 4:25

score 332 · Answer 2 · 2018-04-12 17:59:55

332

Views

How do I show that this DFA accepts this string?

Published on 12 Apr 2018 - 17:59

score 6.2k · Answer 3 · 2018-04-13 05:22:38

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 13 Apr 2018 - 5:22

score 5.1k · Answer 4 · 2018-04-15 12:32:01

5.1k

Views

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

Published on 15 Apr 2018 - 12:32

score 127 · Answer 5 · 2026-03-21 23:52:37

127

Views

DFA with 2 Alphabets

Published on 21 Mar 2026 - 23:52

score 50 · Answer 6 · 2026-03-22 00:14:34

50

Views

Context-Free Grammar / Automata

Published on 22 Mar 2026 - 0:14

score 689 · Answer 7 · 2018-04-22 04:13:12

689

Views

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

Published on 22 Apr 2018 - 4:13

score 179 · Answer 8 · 2026-03-22 19:32:55

179

Views

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

Published on 22 Mar 2026 - 19:32

score 261 · Answer 9 · 2026-03-22 16:35:10

261

Views

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

Published on 22 Mar 2026 - 16:35

score 125 · Answer 10 · 2026-03-22 01:49:21

125

Views

Finding language accepted by a DFA

Published on 22 Mar 2026 - 1:49

score 59 · Answer 11 · 2026-03-22 04:36:06

59

Views

Generalizing Regular Expression from FAs

Published on 22 Mar 2026 - 4:36

score 66 · Answer 12 · 2026-03-21 23:17:56

66

Views

Regular properties of a graph

Published on 21 Mar 2026 - 23:17

score 1.5k · Answer 13 · 2026-03-23 00:47:05

1.5k

Views

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

Published on 23 Mar 2026 - 0:47

score 358 · Answer 14 · 2026-03-21 21:57:19

358

Views

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

Published on 21 Mar 2026 - 21:57

score 288 · Answer 15 · 2018-04-28 20:09:40

288

Views

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

Published on 28 Apr 2018 - 20:09

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