Languages, Decidability, and Complexity

From International Center for Computational Logic

Toggle side column

Languages, Decidability, and Complexity

Stefan HaarStefan Haar,  Tomáš MasopustTomáš Masopust
Languages, Decidability, and Complexity


  • ISBN: 978-1-4471-4275-1
  • ISSN: 0170-8643
  • DOI Link
Stefan Haar, Tomáš Masopust
Languages, Decidability, and Complexity
In C. Seatzu and M. Silva and J.H. van Schuppen, eds., Control of Discrete-event Systems, volume 433 of Lecture Notes in Control and Information Sciences, 23-43. Springer, 2013
  • KurzfassungAbstract
    This chapter presents a brief introduction to the theory of automata, formal languages, decidability, and complexity.
  • Forschungsgruppe:Research Group: Wissensbasierte Systeme
The final publication is available at Springer via http://dx.doi.org/10.1007/978-1-4471-4276-8_2.
@incollection{HM2013,
  author    = {Stefan Haar and Tom{\'{a}}{\v{s}} Masopust},
  title     = {Languages, Decidability, and Complexity},
  editor    = {C. Seatzu and M. Silva and {J.H.} van Schuppen},
  booktitle = {Control of Discrete-event Systems},
  series    = {Lecture Notes in Control and Information Sciences},
  volume    = {433},
  publisher = {Springer},
  year      = {2013},
  pages     = {23-43},
  doi       = {10.1007/978-1-4471-4276-8_2}
}