Decision problems of regular languages, We'll close our consideration of re...

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

Designing finite automata, a finite automata accepting strings over {a,b} e...

a finite automata accepting strings over {a,b} ending in abbbba

Notes, write short notes on decidable and solvable problem

write short notes on decidable and solvable problem

Equivalence of nfas, It is not hard to see that ε-transitions do not add to...

It is not hard to see that ε-transitions do not add to the accepting power of the model. The underlying idea is that whenever an ID (q, σ
v) directly computes another (p, v) via

Dddddddddddddd, wwwwwwwwwwwwwwwwwwww

wwwwwwwwwwwwwwwwwwww

Reducibility among problems, A common approach in solving problems is to tr...

A common approach in solving problems is to transform them to different problems, solve the new ones, and derive the solutions for the original problems from those for the new ones

Arden''s theorem,

What is theory of computtion, what is theory of computtion

what is theory of computtion

Myhill-nerode theorem, This close relationship between the SL2 languages an...

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.

Project, can you plz help with some project ideas relatede to DFA or NFA or...

can you plz help with some project ideas relatede to DFA or NFA or anything