Languages, Decidability, and Complexity

Stefan Haar (1, 2) , Tomáš Masopust (3)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
3 Institute of Mathematics

This chapter presents a brief introduction to the theory of automata, formal languages, decidability, and complexity.

Domaines: Théorie et langage formel [cs.FL]

Stefan Haar, Tomáš Masopust. Languages, Decidability, and Complexity. Carla Seatzu and Manuel Silva and Jan H. van Schuppen. Control of Discrete-Event Systems - Automata and Petri Net Perspectives, Springer, pp.23-43, 2013, Lecture Notes in Control and Information Sciences, 978-1-4471-4275-1. ⟨10.1007/978-1-4471-4276-8_2⟩. ⟨hal-00926094⟩