Semirings, Automata, Languages
W. Kuich · A. Salomaa
pro 2012. · Monographs in Theoretical Computer Science. An EATCS Series Knjiga 5 · Springer Science & Business Media
E-knjiga
376
str.
reportOcjene i recenzije nisu potvrđene Saznajte više
O ovoj e-knjizi
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.
Ocijenite ovu e-knjigu
Recite nam što mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinkronizira s vašim računom i omogućuje vam da čitate online ili offline gdje god bili.
Prijenosna i stolna računala
Audioknjige kupljene na Google Playu možete slušati pomoću web-preglednika na računalu.
Elektronički čitači i ostali uređaji
Za čitanje na uređajima s elektroničkom tintom, kao što su Kobo e-čitači, trebate preuzeti datoteku i prenijeti je na svoj uređaj. Slijedite detaljne upute u centru za pomoć za prijenos datoteka na podržane e-čitače.
