Artículos relacionados a Semirings, Automata, Languages: 5 (Monographs in Theoretical...
Semirings, Automata, Languages: 5 (Monographs in Theoretical Computer Science. An EATCS Series) - Tapa blanda
Sinopsis
Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of "reasonably important" results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ("AFP theory"). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of "reasonably important" results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ("AFP theory"). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 92,27
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Semirings, Automata, Languages: 5 (Monographs in Theoretical...
Imagen del vendedor
Semirings, Automata, Languages
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and . Nº de ref. del artículo: 5068424
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Semirings, Automata, Languages
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of 'reasonably important' results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ('AFP theory'). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results. Nº de ref. del artículo: 9783642699610
Cantidad disponible: 1 disponibles
Imagen de archivo
Semirings, Automata, Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642699610_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Semirings, Automata, Languages
Publicado por
Springer Berlin Heidelberg Nov 2011, 2011
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of 'reasonably important' results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ('AFP theory'). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results. 388 pp. Englisch. Nº de ref. del artículo: 9783642699610
Cantidad disponible: 2 disponibles
Imagen del vendedor
Semirings, Automata, Languages
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2011, 2011
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Automata theory is the oldest among the disciplines constituting the subject matter of this Monograph Series: theoretical computer science. Indeed, automata theory and the closely related theory of formal languages form nowadays such a highly developed and diversified body of knowledge that even an exposition of 'reasonably important' results is not possible within one volume. The purpose of this book is to develop the theory of automata and formal languages, starting from ideas based on linear algebra. By what was said above, it should be obvious that we do not intend to be encyclopedic. However, this book contains the basics of regular and context-free languages (including some new results), as well as a rather complete theory of pushdown automata and variations (e. g. counter automata). The wellknown AFL theory is extended to power series ('AFP theory'). Additional new results include, for instance, a grammatical characterization of the cones and the principal cones of context-free languages, as well as new decidability results.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 388 pp. Englisch. Nº de ref. del artículo: 9783642699610
Cantidad disponible: 1 disponibles
Imagen de archivo
Semirings, Automata, Languages
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 388. Nº de ref. del artículo: 2658591752
Cantidad disponible: 4 disponibles
Imagen de archivo
Semirings, Automata, Languages
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 388 23 Figures, 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 50968023
Cantidad disponible: 4 disponibles
Imagen de archivo
Semirings, Automata, Languages (Monographs in Theoretical Computer Science. An Eatcs Series)
Publicado por
Springer Berlin Heidelberg, 2012
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. reprint edition. 388 pages. 9.60x6.60x0.90 inches. In Stock. Nº de ref. del artículo: x-3642699618
Cantidad disponible: 2 disponibles
Imagen de archivo
Semirings, Automata, Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020234372
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Semirings, Automata, Languages
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 388. Nº de ref. del artículo: 1858591746
Cantidad disponible: 4 disponibles