### finite-automata

What is the english description for this DFA?

This NFA to DFA conversion is confusing me

Can {a,b,c}*a^n{a,b,c}*b^n{a,b,c}*c^n{a,b,c} be accepted by an FSA?

Does jflap support (+) operator in a regular expression?

Definition of the “DFA for a language”

Give context-free grammars that generate the following language

Theoretical Approach for Deterministic Finite Automata

Regular Expression in Finite Automata

Is it possible for a DFA to change its state to a new state without accepting any input symbol

Definition of a language in Automata Theory

Designing DFA to accept language of even length beginning with 01

Optimization of Thompson Construction of an NFA

How can I tell from viewing the circuit if a machine is Moore machine or Mealy machine?

FA for a language which forms an AGP

how can i get weighted finite automaton?

which part of compiler is based on AT

From Recurrent Neural Networks (RNNs) to Finte State Automata (FSAs)

How to shift data in turing machine?

number of dfa's that can be designed

what is the regular expression for the automaton?

how we can find regular expression for following strings

How can I prove this language is regular?

How to draw a DFA for given language?

How to determine the number of states of finite automata according to any language?

Deterministic Finite State Automata for Modulo Comparison

DFA for integer in binary that is: 1mod5

Solve three letter string into regular expression way

What is the difference between an Alphabet and an element of a set?

Define strings and draw language

Can I use stack in Turing Machine?

Why is this issue in the article impossible?

Finding the smallest DFA that separates two words without using brute force search?

How to represent a coffee machine using DFA?

Performance characteristics of a non-minimal DFA

Does there exist a TM for all countable languages?

In this minimal perfect hashing function, what is meant by FirstLetter and Predecessor?

Finite State Automata Diagrams

What is a real life example of a Moore machine?

What are three dots in this DFA?

Can All States Be Final In A Deterministic Pushdown Automata?

Are there any steps or rules to draw a DFA?

Algorithm which decides whether L(M) = {a} or L(M) =/= {a}

Automata theory : Conversion of a Context free grammar to a DFA

Turing machine that accepts strings with an equal beginning and end length

Impossible Finite State Automata?

Difference between transition diagram and finite automata

Finite Automata Definition of language

Can final and non-final states having identical configurations be merged together in a minimal DFA?

automata theorem: existance of a DFA [closed]

Simulating regular expressions with deterministic finite automata and the size of the alphabet

### Related Links

Minimum number of states in a DFA having '1' as the 5th symbol from right

What is the application of automata?

How to use the intersection construction to form a DFA?

Question about Finite State Automata

Equivalence between two automata

What are some specific applications of finite state automata? [closed]

Advantages/Disadvantages of NFA over DFA and vice versa

What is the typical alphabet size of Finite State Machines?

Is this DFA correct?

Minimum number of states needed?

Am I correct? (Finite Automata)

Finite state machines and deadlocks

Deterministic/non-deterministic state system mapping

Construct a DFA for the following language: all strings that have at least three 0s and at most two 1s

When you are proving a language is decidable, what are you effectively doing?

formal languages: what does R-trivial mean?