|
| Título : |
Formal languages and automata theory |
| Tipo de documento: |
texto impreso |
| Autores: |
Chander Kumar Nagpal, Autor |
| Mención de edición: |
Primera edición |
| Editorial: |
México, D.F. : Oxford Univerity Press |
| Fecha de publicación: |
2011 |
| Número de páginas: |
xiv, 348 páginas |
| Il.: |
ilustraciones, diagramas, tablas |
| Dimensiones: |
24 cm |
| ISBN/ISSN/DL: |
978-0-19-807106-8 |
| Idioma : |
Inglés (eng) |
| Clasificación: |
624.183402 Hormigón. Manuales |
| Nota de contenido: |
Automata, formal languages, and computability -- Mathematical preliminaries -- Finite automata -- Regular grammar and regular sets -- Context-free grammars and languages -- Pushdown automata -- Turing machines -- The pitfall of algorithmic computing: undesirability -- Computable functions -- Computational complexity: tractable and possibly intractable problems. |
| Link: |
https://biblioteca.unap.edu.pe/opac_css/index.php?lvl=notice_display&id=106298 |
Formal languages and automata theory [texto impreso] / Chander Kumar Nagpal, Autor . - Primera edición . - México, D.F. : Oxford Univerity Press, 2011 . - xiv, 348 páginas : ilustraciones, diagramas, tablas ; 24 cm. ISBN : 978-0-19-807106-8 Idioma : Inglés ( eng)
| Clasificación: |
624.183402 Hormigón. Manuales |
| Nota de contenido: |
Automata, formal languages, and computability -- Mathematical preliminaries -- Finite automata -- Regular grammar and regular sets -- Context-free grammars and languages -- Pushdown automata -- Turing machines -- The pitfall of algorithmic computing: undesirability -- Computable functions -- Computational complexity: tractable and possibly intractable problems. |
| Link: |
https://biblioteca.unap.edu.pe/opac_css/index.php?lvl=notice_display&id=106298 |
Formal languages and automata theory
Nagpal, Chander Kumar -
México, D.F. : Oxford Univerity Press - 2011
Automata, formal languages, and computability -- Mathematical preliminaries -- Finite automata -- Regular grammar and regular sets -- Context-free grammars and languages -- Pushdown automata -- Turing machines -- The pitfall of algorithmic computing: undesirability -- Computable functions -- Computational complexity: tractable and possibly intractable problems.
|
|  |
Formal languages and automata theory / México, D.F. : Oxford Univerity Press (2011)
