|
|
|
|
| LEADER |
00000nam a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250423182832.0 |
| 008 |
230201s1989 xxua r 000 0 eng d |
| 020 |
|
|
|a 0139138153
|
| 024 |
8 |
|
|a DIF-M226
|b 226
|z DIF000232
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Carroll, John M.
|9 43202
|
| 245 |
1 |
0 |
|a Theory of finite automata :
|b with an introduction to formal languages
|
| 250 |
|
|
|a 1st ed.
|
| 260 |
|
|
|a Englewood Cliffs :
|b Prentice Hall,
|c c1989
|
| 300 |
|
|
|a viii, 438 p. :
|b il. ;
|c 23 cm.
|
| 505 |
0 |
|
|a Characterization of FAD languages -- Minimization of finite automata -- Nondeterministic finite automata -- Closure properties -- Regular expressions -- Finite-state transducers -- Regular grammars -- Context-free languages -- Pushdown automata -- Turing machines -- Decidability.
|
| 650 |
|
4 |
|a AUTÓMATAS
|9 43203
|
| 650 |
|
4 |
|a LENGUAJES FORMALES
|9 42863
|
| 700 |
1 |
|
|a Long, Darrell
|9 43204
|
| 942 |
|
|
|c BK
|
| 999 |
|
|
|c 50232
|d 50232
|
