Question

DFM accepting sum of ab* and ba*

score 99 · Answer 1 · 2019-02-18 15:41:02

99

Views

DFM accepting sum of ab* and ba*

Published on 18 Feb 2019 - 15:41

score 50 · Answer 2 · 2019-02-18 23:05:04

50

Views

regular language proof

Published on 18 Feb 2019 - 23:05

score 41 · Answer 3 · 2019-02-22 20:18:32

41

Views

DFA construction - How to construct an automaton that contains either 0 or 1 occurrences of 010?

Published on 22 Feb 2019 - 20:18

score 78 · Answer 4 · 2019-02-23 11:08:08

78

Views

How can we modify the proof if the alphabet in $M_1$ and the alphabet in $M_2$ are not the same? (Regular Language, Sipser)

Published on 23 Feb 2019 - 11:08

score 1.7k · Answer 5 · 2019-02-23 20:38:46

1.7k

Views

The definition of the empty string.

Published on 23 Feb 2019 - 20:38

score 366 · Answer 6 · 2019-03-03 23:06:03

366

Views

FA that accepts odd 1's and ends with 101

Published on 03 Mar 2019 - 23:06

score 119 · Answer 7 · 2026-03-24 16:19:45

119

Views

Finding the equivalence classes of a singleton set

Published on 24 Mar 2026 - 16:19

score 49 · Answer 8 · 2019-03-08 15:19:16

49

Views

How to interpret the following DFA's language?

Published on 08 Mar 2019 - 15:19

score 59 · Answer 9 · 2019-03-14 21:57:41

59

Views

The formal language $L$ is regular iff there is a "reduced" NFA

Published on 14 Mar 2019 - 21:57

score 961 · Answer 10 · 2019-03-18 01:45:00

961

Views

Automata|The mid 1/3 of regular language is still regular

Published on 18 Mar 2019 - 1:45

score 58 · Answer 11 · 2019-03-20 11:49:39

58

Views

How would be a formal answer for an automata geometry problem?

Published on 20 Mar 2019 - 11:49

score 197 · Answer 12 · 2019-03-22 09:52:16

197

Views

Automata|f(L) take the length of a regular language's prefix to the length of the rest

Published on 22 Mar 2019 - 9:52

score 172 · Answer 13 · 2019-03-24 01:47:51

172

Views

What happens when apply reversal to the empty language?

Published on 24 Mar 2019 - 1:47

score 83 · Answer 14 · 2019-03-30 21:59:30

83

Views

Why is this an NFA, but not an FA?

Published on 30 Mar 2019 - 21:59

score 1.4k · Answer 15 · 2019-04-03 05:22:01

1.4k

Views

Combine 2 DFAs to produce a new DFA that accept L1 U L2

Published on 03 Apr 2019 - 5:22

List Question

DFM accepting sum of ab* and ba*

regular language proof

DFA construction - How to construct an automaton that contains either 0 or 1 occurrences of 010?

How can we modify the proof if the alphabet in $M_1$ and the alphabet in $M_2$ are not the same? (Regular Language, Sipser)

The definition of the empty string.

FA that accepts odd 1's and ends with 101

Finding the equivalence classes of a singleton set

How to interpret the following DFA's language?

The formal language $L$ is regular iff there is a "reduced" NFA

Automata|The mid 1/3 of regular language is still regular

How would be a formal answer for an automata geometry problem?

Automata|f(L) take the length of a regular language's prefix to the length of the rest

What happens when apply reversal to the empty language?

Why is this an NFA, but not an FA?

Combine 2 DFAs to produce a new DFA that accept L1 U L2

Trending Questions

Popular # Hahtags

Popular Questions