List questions from finite-automata

Published on 14 Sep 2016 - 5:51

1.9k

Views

Can a finite state machine contain an unreachable state?

Published on 15 Sep 2016 - 17:00

966

Views

For $n\ge 1$ let $A_n =\{w\in\{0,1\}^∗\mid w$ is a binary number that is a multiple of $n\}$, and prove that $A_n$ is regular.

Published on 20 Sep 2016 - 0:36

135

Views

formal grammar from automaton

Published on 25 Mar 2026 - 11:12

67

Views

Making the difference of a Non-Finite Deterministic Automaton.

Published on 25 Sep 2016 - 7:27

153

Views

Design an automaton that accept the the set of strings $a$'s and $b$'s of length at least $2$

Published on 03 Oct 2016 - 5:45

111

Views

Regular expression equivalent to following automaton?

Published on 10 Oct 2016 - 8:13

816

Views

Number of functions $f:[4]\times[4]\rightarrow[4]$

Published on 14 Oct 2016 - 17:35

210

Views

How to turn this expression into an NFA?

Published on 16 Oct 2016 - 1:48

35

Views

regular language (or not)

Published on 16 Oct 2016 - 11:51

120

Views

Formal algorithm that accepts two finite automatons and outputs finite automaton

Published on 19 Oct 2016 - 20:20

1k

Views

How do I prove that this language is not regular?

Published on 24 Oct 2016 - 7:41

771

Views

NFA to GNFA, for the same state do we add an epsilon or a phi?

Published on 31 Oct 2016 - 4:17

358

Views

Enumeration of finite automata

Published on 31 Oct 2016 - 21:18

67

Views

How to translate this deterministic finite state automata into a regular expression..

Published on 05 Nov 2016 - 16:57

List Question

Check whether the N:th number from the right is a 1 in a Deterministic Finite State Machine

Can a finite state machine contain an unreachable state?

For $n\ge 1$ let $A_n =\{w\in\{0,1\}^∗\mid w$ is a binary number that is a multiple of $n\}$, and prove that $A_n$ is regular.

formal grammar from automaton

Making the difference of a Non-Finite Deterministic Automaton.

Design an automaton that accept the the set of strings $a$'s and $b$'s of length at least $2$

Regular expression equivalent to following automaton?

Number of functions $f:[4]\times[4]\rightarrow[4]$

How to turn this expression into an NFA?

regular language (or not)

Formal algorithm that accepts two finite automatons and outputs finite automaton

How do I prove that this language is not regular?

NFA to GNFA, for the same state do we add an epsilon or a phi?

Enumeration of finite automata

How to translate this deterministic finite state automata into a regular expression..

Trending Questions

Popular # Hahtags

Popular Questions