Question

How to find a language L that is equal to L*??

score 371 · Answer 1 · 2026-03-25 17:37:52

371

Views

How to find a language L that is equal to L*??

Published on 25 Mar 2026 - 17:37

score 2.4k · Answer 2 · 2026-03-25 17:40:30

2.4k

Views

Minimum number of states of a DFA recognizing the regular expression $(a+b)^*b(a+b)$

Published on 25 Mar 2026 - 17:40

score 57 · Answer 3 · 2026-03-26 12:40:16

57

Views

Prove a relation . languages

Published on 26 Mar 2026 - 12:40

score 633 · Answer 4 · 2017-02-12 19:54:39

633

Views

Number of necessary states in DFA/NFA.

Published on 12 Feb 2017 - 19:54

score 524 · Answer 5 · 2017-02-16 17:59:59

524

Views

Is it possible to OR with an empty set?

Published on 16 Feb 2017 - 17:59

score 1.6k · Answer 6 · 2017-02-19 16:05:59

1.6k

Views

Show a set of numbers, binary representation of which is a regular language, but the ternary representation is not.

Published on 19 Feb 2017 - 16:05

score 149 · Answer 7 · 2017-02-20 19:18:47

149

Views

Upper-bounds intersection NFA

Published on 20 Feb 2017 - 19:18

score 574 · Answer 8 · 2026-03-25 20:42:04

574

Views

Prove that Doubling operation on a language has an automata associated?

Published on 25 Mar 2026 - 20:42

score 1.5k · Answer 9 · 2026-03-25 22:06:20

1.5k

Views

Let Σ={1,2,3,4,5,6,7,8}. How many strings of length 3 or less are there over Σ?

Published on 25 Mar 2026 - 22:06

score 354 · Answer 10 · 2017-03-06 13:57:02

354

Views

Prove that Language is Regular Using Closure Properties

Published on 06 Mar 2017 - 13:57

score 738 · Answer 11 · 2017-03-08 21:53:58

738

Views

Prove the Halting Problem is undecidable (using a reduction)

Published on 08 Mar 2017 - 21:53

score 134 · Answer 12 · 2017-03-12 17:21:11

134

Views

Relation between group action in abstract algebra and semi-automaton

Published on 12 Mar 2017 - 17:21

score 444 · Answer 13 · 2017-03-12 23:12:17

444

Views

Subset contruction. Constructing a DFA from an NFA.

Published on 12 Mar 2017 - 23:12

score 66 · Answer 14 · 2017-03-14 07:01:04

66

Views

How to construct an automata that contains an $a$ within the $k$ last chars?

Published on 14 Mar 2017 - 7:01

score 626 · Answer 15 · 2017-03-15 22:33:20

626

Views

Why in a DFA the empty string distinguishes any accept state from any reject state?

Published on 15 Mar 2017 - 22:33

List Question

How to find a language L that is equal to L*??

Minimum number of states of a DFA recognizing the regular expression $(a+b)^*b(a+b)$

Prove a relation . languages

Number of necessary states in DFA/NFA.

Is it possible to OR with an empty set?

Show a set of numbers, binary representation of which is a regular language, but the ternary representation is not.

Upper-bounds intersection NFA

Prove that Doubling operation on a language has an automata associated?

Let Σ={1,2,3,4,5,6,7,8}. How many strings of length 3 or less are there over Σ?

Prove that Language is Regular Using Closure Properties

Prove the Halting Problem is undecidable (using a reduction)

Relation between group action in abstract algebra and semi-automaton

Subset contruction. Constructing a DFA from an NFA.

How to construct an automata that contains an $a$ within the $k$ last chars?

Why in a DFA the empty string distinguishes any accept state from any reject state?

Trending Questions

Popular # Hahtags

Popular Questions