| 000 | nam a22 7a 4500 | ||
|---|---|---|---|
| 999 |
_c48532 _d48532 |
||
| 005 | 20230912131718.0 | ||
| 008 | 230911s2015 xxua|||fr|||| 00| 0 eng d | ||
| 020 | _a9781284077247 | ||
| 040 |
_aCO-NeUS _bspa _erda |
||
| 041 | _aeng | ||
| 100 | 1 |
_9155323 _aLinz, Peter _eaut |
|
| 245 | 1 |
_aAn introduction to formal languages and automata / _cPeter Linz |
|
| 250 | _aSixth edition | ||
| 264 | 1 |
_aCalifornia : _bJones & Bartlett, _c2017 |
|
| 300 | 1 |
_a450 páginas : _bilustraciones a color ; _c24 cm. |
|
| 336 |
_2rdacontent _atxt |
||
| 337 |
_2rdamedia _an _bn |
||
| 338 |
_2rdacarrier _anc _bnc |
||
| 347 | _2rda | ||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _aIntroduction to the theory of computation -- Finite automata -- Regular languages and regular grammars -- Properties of regular languages -- Context-free languages -- Simplification of context-free grammars and normal forms -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Other model of turing machines -- A hierarchy of formal languages and automata -- Limits of algorithmic computation -- Other models of computation -- An overview of computational complexity -- Appendix a Finite-state transducers -- answers solutions and hints for selected exercises -- References for further reading. | ||
| 082 | 0 | 4 |
_221 _a005.13 / _bL762f |
| 650 | 1 | 7 |
_2LEMB _9155324 _aFormal languages |
| 650 | 1 | 7 |
_2LEMB _915067 _aLenguajes formales |
| 650 | 1 | 7 |
_2LEMB _9155325 _aMachine theory |
| 650 | 1 | 7 |
_2LEMB _910059 _aTeoría de las maquinas |
| 942 |
_2ddc _cCG _h005.13 / _kL762f |
||