Deterministic finite state automaton, Theory of Computation

De?nition Deterministic Finite State Automaton: For any state set Q and alphabet Σ, both ?nite, a ?nite state automaton (FSA) over Q


Σ is a ?ve-tuple (Q,Σ, T, q0, F), where:

• T ⊆ Q × Q × Σ,

• q0 ∈ Q is the initial state (also know as the start state) and

• F ⊆ Q is the set of accepting states (also spuriously known as ?nal states).

The FSA is deterministic (a DFA) if for all q ∈ Q and σ ∈ Σ, there is exactly one p ∈ Q such that (q, p, σ) ∈ T.

Each triple in T = hq, p, σi represents an edge from state q to p labeled σ in the transition graph. The state q0 is the initial state of the transition graph (marked by the "edge from nowhere") and the states in F are the states distinguished by being circled. An FSA is deterministic if there is never any choice of what the next state is, given the current state and input symbol and there is never no choice. In terms of the transition graph, this means that every node will have exactly one out-edge for each symbol of the alphabet.

Posted Date: 3/21/2013 3:29:19 AM | Location : United States

Related Discussions:- Deterministic finite state automaton, Assignment Help, Ask Question on Deterministic finite state automaton, Get Answer, Expert's Help, Deterministic finite state automaton Discussions

Write discussion on Deterministic finite state automaton
Your posts are moderated
Related Questions
i want to do projects for theory of computation subject what topics should be best.

A problem is said to be unsolvable if no algorithm can solve it. The problem is said to be undecidable if it is a decision problem and no algorithm can decide it. It should be note

S-->AAA|B A-->aA|B B-->epsilon

As we are primarily concerned with questions of what is and what is not computable relative to some particular model of computation, we will usually base our explorations of langua

We can then specify any language in the class of languages by specifying a particular automaton in the class of automata. We do that by specifying values for the parameters of the

We will assume that the string has been augmented by marking the beginning and the end with the symbols ‘?' and ‘?' respectively and that these symbols do not occur in the input al

Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.

(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?