Académique Documents
Professionnel Documents
Culture Documents
CLASE MODELO
• Es un diagrama de transiciones.
OFF ON
PUSH
Autómata
• Diseño y verificación de circuitos digitales.
M= ( Q , Σ, s ,F, δ )
L = { (ab) n | n ≥ 1 }
Tabla de Transiciones.
a b b a a, b
q0 q1 q2
a b
->q0 q0 q1
q1 q2 q1
*q2 q2 q2
Referencias
•Sudkamp, Thomas A., Languages and machines : an introduction
to the theory of computer science / Thomas A. Sudkamp., 2nd ed.,
Reprinted with corrections., Reading, Mass. : Addison-Wesley
Pub., c1998, c1997., Massachusetts, c1998, c1997., eng.
•
* Hopcroft, John E., 1939-, Introduction to automata theory,
languages, and computation / John E. Hopcroft, Rajeev Motwani,
Jeffrey D. Ullman., 2th ed., Boston : Addison-Wesley, c2001,
Massachusetts, c2001, eng.
CLASE MODELO