skip to main
|
skip to sidebar
20080807
Os automatos finitos são reconhecedores de linguagens regulares
definidas através de quíntuplas da forma M=(E,V,f,q0,F)
2 comments:
Anonymous said...
Sehr schõn...
12:10:00 AM
Baldo Mero
said...
Dankeshon!
6:36:00 PM
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
2 comments:
Sehr schõn...
Dankeshon!
Post a Comment