State Complexity of Projected Languages

  • Galina Jirásková
  • Tomáš Masopust
Conference paper

DOI: 10.1007/978-3-642-22600-7_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Jirásková G., Masopust T. (2011) State Complexity of Projected Languages. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

This paper discusses the state complexity of projected regular languages represented by incomplete deterministic finite automata. It is shown that the known upper bound is reachable only by automata with one unobservable transition, that is, a transition labeled with a symbol removed by the projection. The present paper improves this upper bound by considering the structure of the automaton. It also proves that the new bounds are tight, considers the case of finite languages, and presents several open problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Galina Jirásková
    • 1
  • Tomáš Masopust
    • 2
    • 3
  1. 1.Mathematical InstituteSlovak Academy of SciencesKošiceSlovak Republic
  2. 2.CWIAmsterdamThe Netherlands
  3. 3.Institute of MathematicsCzech Academy of SciencesBrnoCzech Republic

Personalised recommendations