Articoli correlati a Semirings, Automata, Languages: 5
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti:
I. Linear Algebra.- 1. Semirings and Power Series.- 2. Convergence, Equations and Identities.- 3. Strong Convergence and Cycle-Free Power Series.- 4. Matrices, Linear Systems and Identities.- 5. Semirings with Particular Properties.- 6. Morphisms and Representations.- II. Automata.- 7. Automata in Terms of Matrices.- 8. Rational Power Series and Decidability.- 9. Rational Transductions.- 10. Pushdown Automata.- 11. Abstract Families of Power Series.- 12. Substitutions.- 13. Reset Pushdown Automata and Counter Automata.- III. Algebraic Systems.- 14. Algebraic Series and Context-Free Languages.- 15. The Super Normal Form.- 16. Commuting Variables: Decidability and Parikh’s Theorem.- Historical and Bibliographical Remarks.- References.- Symbol Index.
Product Description:
Book by Kuich W Salomaa A
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer Berlin Heidelberg
- Data di pubblicazione1986
- ISBN 10 3642699618
- ISBN 13 9783642699610
- RilegaturaCopertina flessibile
- Numero di pagine388
Compra nuovo
Scopri di più su questo articolo
EUR 106,85
Spese di spedizione:
GRATIS
In U.S.A.
I migliori risultati di ricerca su AbeBooks
Immagini fornite dal venditore
Semirings, Automata, Languages (Monographs in Theoretical Computer Science. An EATCS Series) by Kuich, W., Salomaa, A. [Paperback ]
Da:
Valutazione libreria
Descrizione libro Soft Cover. Condizione: new. Codice articolo 9783642699610
Compra nuovo
EUR 106,85
Convertire valuta
Foto dell'editore
Semirings, Automata, Languages (Monographs in Theoretical Computer Science. An EATCS Series, 5)
Da:
Valutazione libreria
Descrizione libro Condizione: New. Codice articolo ABLIING23Mar3113020234372
Compra nuovo
EUR 111,76
Convertire valuta
Foto dell'editore
Semirings, Automata, Languages
Print on Demand
Da:
Valutazione libreria
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9783642699610_lsuk
Compra nuovo
EUR 115,32
Convertire valuta
Immagini fornite dal venditore
Semirings, Automata, Languages
Editore:
Springer Berlin Heidelberg Nov 2011
(2011)
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuovo
Taschenbuch
Quantità: 2
Da:
Valutazione libreria
Descrizione libro Taschenbuch. Condizione: 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. Codice articolo 9783642699610
Compra nuovo
EUR 112,34
Convertire valuta
Immagini fornite dal venditore
Semirings, Automata, Languages
Editore:
Springer Berlin Heidelberg
(2011)
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuovo
Brossura
Quantità: > 20
Da:
Valutazione libreria
Descrizione libro Condizione: 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 . Codice articolo 5068424
Compra nuovo
EUR 92,27
Convertire valuta
Immagini fornite dal venditore
Semirings, Automata, Languages
Editore:
Springer Berlin Heidelberg
(2011)
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuovo
Taschenbuch
Quantità: 1
Da:
Valutazione libreria
Descrizione libro Taschenbuch. Condizione: 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. Codice articolo 9783642699610
Compra nuovo
EUR 113,89
Convertire valuta
Foto dell'editore
Semirings, Automata, Languages (Monographs in Theoretical Computer Science. An Eatcs Series)
Editore:
Springer Berlin Heidelberg
(2012)
ISBN 10: 3642699618
ISBN 13: 9783642699610
Nuovo
Paperback
Quantità: 2
Da:
Valutazione libreria
Descrizione libro Paperback. Condizione: Brand New. reprint edition. 388 pages. 9.60x6.60x0.90 inches. In Stock. Codice articolo x-3642699618
Compra nuovo
EUR 137,63
Convertire valuta