Computation of a dfa or nfa, Theory of Computation

Computation of a DFA or NFA without ε-transitions

An ID (q1,w1) computes (qn,wn) in A = (Q,Σ, T, q0, F) (in zero or more steps)

2490_Computation of a DFA or NFA.png

if there is a sequence of IDs (q1,w1), . . . qn,wn)) in which, for all i > 1, 899_Computation of a DFA or NFA1.png

A computation of an FSA A on input w is a computation from the initial ID (q0,w) to a terminal ID: ((q0,wi, . . . , (q, ε)).

The fact that |-A is no longer partial functional implies that we can no longer speak of the computation of A on hq1,w1i. What's more, while every computation is ?nite, it is no longer true that they all take exactly |w1| steps. Computations end when they reach an ID with no successor; this can now be either because the entire input was scanned or because an ID hq, σ  wi was reached for which δ(q, σ) = ∅. Only the ?rst case represents successful processing of w1 by A; we need to be careful to distinguish "halting" computations from those that "crash".

Posted Date: 3/21/2013 2:32:51 AM | Location : United States







Related Discussions:- Computation of a dfa or nfa, Assignment Help, Ask Question on Computation of a dfa or nfa, Get Answer, Expert's Help, Computation of a dfa or nfa Discussions

Write discussion on Computation of a dfa or nfa
Your posts are moderated
Related Questions
Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.

The class of Strictly Local Languages (in general) is closed under • intersection but is not closed under • union • complement • concatenation • Kleene- and positive

examples of decidable problems

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.


We saw earlier that LT is not closed under concatenation. If we think in terms of the LT graphs, recognizing the concatenation of LT languages would seem to require knowing, while

When we say "solved algorithmically" we are not asking about a speci?c programming language, in fact one of the theorems in computability is that essentially all reasonable program

What is the purpose of GDTR?

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

LTO was the closure of LT under concatenation and Boolean operations which turned out to be identical to SF, the closure of the ?nite languages under union, concatenation and compl