Automata Theory and Formal Languages

Fundamental Notions, Theorems, and Techniques
280 Seiten, Taschenbuch
€ 60,49
-
+
Lieferbar in 9 Werktagen

Bitte haben Sie einen Moment Geduld, wir legen Ihr Produkt in den Warenkorb.

Mehr Informationen
Reihe Undergraduate Topics in Computer Science
ISBN 9783031119644
Sprache Englisch
Erscheinungsdatum 13.08.2022
Genre Informatik, EDV/Informatik
Verlag Springer International Publishing
LieferzeitLieferbar in 9 Werktagen
HerstellerangabenAnzeigen
Springer Nature Customer Service Center GmbH
Europaplatz 3 | DE-69115 Heidelberg
ProductSafety@springernature.com
Unsere Prinzipien
  • ✔ kostenlose Lieferung innerhalb Österreichs ab € 35,–
  • ✔ über 1,5 Mio. Bücher, DVDs & CDs im Angebot
  • ✔ alle FALTER-Produkte und Abos, nur hier!
  • ✔ hohe Sicherheit durch SSL-Verschlüsselung (RSA 4096 bit)
  • ✔ keine Weitergabe personenbezogener Daten an Dritte
  • ✔ als 100% österreichisches Unternehmen liefern wir innerhalb Österreichs mit der Österreichischen Post
Kurzbeschreibung des Verlags


Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.

Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages.  The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.



Topics and features:


  • Provides theorems, examples, and exercises to clarify automata-languages correspondences
  • Presents some fundamental techniques for parsing both regular and context-free languages
  • Classifies subclasses of decidable problems, avoiding focus on the theory of complexity
  • Examines finite-automata minimalization and characterization of their behavior using regular expressions
  • Illustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms
  • Offers supplementary material on counter machines, stack automata, and abstract language families







  • This highly useful, varied text/reference is suitable for undergraduate and graduatecourses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.




    Alberto Pettorossi
     

    is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.


    Mehr Informationen
    Reihe Undergraduate Topics in Computer Science
    ISBN 9783031119644
    Sprache Englisch
    Erscheinungsdatum 13.08.2022
    Genre Informatik, EDV/Informatik
    Verlag Springer International Publishing
    LieferzeitLieferbar in 9 Werktagen
    HerstellerangabenAnzeigen
    Springer Nature Customer Service Center GmbH
    Europaplatz 3 | DE-69115 Heidelberg
    ProductSafety@springernature.com
    Unsere Prinzipien
    • ✔ kostenlose Lieferung innerhalb Österreichs ab € 35,–
    • ✔ über 1,5 Mio. Bücher, DVDs & CDs im Angebot
    • ✔ alle FALTER-Produkte und Abos, nur hier!
    • ✔ hohe Sicherheit durch SSL-Verschlüsselung (RSA 4096 bit)
    • ✔ keine Weitergabe personenbezogener Daten an Dritte
    • ✔ als 100% österreichisches Unternehmen liefern wir innerhalb Österreichs mit der Österreichischen Post