(Ebook) Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques by Alberto Pettorossi ISBN 9783031119644, 3031119649

(Ebook) Automata Theory and Formal Languages: Fundamental Notions, Theorems, and Techniques by Alberto Pettorossi ISBN 9783031119644, 3031119649

In this book we present some basic notions and results on Automata Theory,Formal Language Theory, Computability Theory, and Parsing Theory.In particular, we consider the class of regular languages which are related tothe class of finite automata, and the class of the context-free languages which arerelated to the class of pushdown automata. For the finite automata we also studythe problem of their minimalization and the characterization of their behaviourusing regular expressions.For context-free languages we illustrate how to derive their grammars in Chomskyand Greibach normal form. We study the relationship between deterministicand nondeterministic pushdown automata and the context-free languages they accept.We present also some fundamental techniques for parsing both regular andcontext-free languages.Then we consider more powerful automata and we illustrate the relationshipbetween linear bounded automata and context-sensitive languages, and betweenTuring Machines and type 0 languages. Chapter 6 of the book is dedicated tothe analysis of various decidability and undecidability problems in context-freelanguages.