Skip to main content
SpringerLink
Log in

Finite transducers and nondeterministic state complexity of regular languages

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We obtain a sharp upper bound for the nondeterministic state complexity of the application of a finite transducer to a regular language.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.-C. Birget, “Intersection and Union of Regular Languages and State Complexity,” Inform. Proc. Lett. 43(4), 185–190 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Gruber and M. Holzer, “Finding Lower Bounds for Nondeterministic State Complexity is Hard,” Lect. Notes Comput. Sci. 4036, 363–374 (2006).

    Article  MathSciNet  Google Scholar 

  3. M. Kutrib and M. Holzer, “Unary Language Operations and Their Nondeterministic State Complexity,” Lect. Notes Comput. Sci. 2450, 162–172 (2003).

    Article  MathSciNet  Google Scholar 

  4. K. Salomaa, “Descriptional Complexity of Nondeterministic Finite Automata,” Lect. Notes Comput. Sci. 4588, 31–35 (2007).

    Article  MathSciNet  Google Scholar 

  5. M. Kutrib and M. Holzer, “State Complexity of Basic Operations on Nondeterministic Finite Automata,” Lect. Notes Comput. Sci. 2608, 148–157 (2003).

    Article  MathSciNet  Google Scholar 

  6. S. Yu, “Regular Languages,” in Handbook of Formal Languages, Ed. by G. Rozenberg and A. Salomaa (N.-Y., Springer, 1997), Vol. 1, pp. 41–110.

    Google Scholar 

  7. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, MA, 2001).

    MATH  Google Scholar 

  8. V. B. Kudryavtsev, S. V. Aleshin, and A. S. Podkolzin, Introduction to Automata Theory (Nauka, Moscow, 1985) [in Russian].

    MATH  Google Scholar 

  9. J. Sakarovitch, Éléments de Théorie des Automates (Vuibert Informatique, Paris, 2003).

    MATH  Google Scholar 

  10. C. Calude, K. Salomaa, and S. Yu, “Metric Lexical Analysis,” Lect.Notes Comput. Sci. 2214, 48–59 (2001).

    Article  Google Scholar 

  11. J. Karhumäki, “Automata and Formal Languages,” http://www.math.utu.fi/en/home/karhumak/Automata2007.pdf

  12. G. Povarov, “Descriptive Complexity of the Hamming Neighborhood of a Regular Language,” Proc. Conf. “Language and Automata Theory and Applications” (Tarragona, Universitat Rovira i Virgili, 2007), pp. 509–520.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, 51 Lenin str., K-83, Ekaterinburg, 620083, Russia

    G. A. Povarov

Authors
  1. G. A. Povarov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. A. Povarov.

Additional information

Original Russian Text © G.A. Povarov, 2010, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, No. 6, pp. 23–31.

About this article

Cite this article

Povarov, G.A. Finite transducers and nondeterministic state complexity of regular languages. Russ Math. 54, 19–25 (2010). https://doi.org/10.3103/S1066369X10060034

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X10060034

Key words and phrases

Search

Navigation