Verwandte Artikel zu Automata Theory and Formal Languages: Fundamental Notions,...

Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques (Undergraduate Topics in Computer Science) - Softcover

Pettorossi, Alberto

 
9783031119644: Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques (Undergraduate Topics in Computer Science)
Softcover
ISBN 10: 3031119649 ISBN 13: 9783031119644
Verlag: Springer, 2022

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

Alberto Pettorossi is Professor of Theoretical Computer Science at the Engineering Faculty of the University of Rome Tor Vergata (Italy). His current research interests include the development of logic-based techniques for the automatic derivation, transformation, and verification of programs.

Von der hinteren Coverseite

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; linearbounded 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 graduate courses 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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2022
Sprache
Englisch
ISBN 10 
3031119649
ISBN 13 
9783031119644
Einband
Taschenbuch
Auflage
1
Anzahl der Seiten
288
Kontakt zum Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Deutschland