Optimal simulations between unary automata

  • Carlo Mereghetti
  • Giovanni Pighizzini
Automata and Formal Languages I

DOI: 10.1007/BFb0028556

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)
Cite this paper as:
Mereghetti C., Pighizzini G. (1998) Optimal simulations between unary automata. In: Morvan M., Meinel C., Krob D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg

Abstract

We consider the problem of computing the costs — in terms of states — of optimal simulations between different kinds of finite automata recognizing unary languages. Our main result is a tight simulation of unary n-state two-way nondeterministic automata by \(O(e^{\sqrt {n \ln n} } )\)-state one-way deterministic automata. In addition, we show that, given a unary n-state two-way nondeterministic automaton, one can construct an equivalent O(n2)-state two-way nondeterministic automaton performing both input head reversals and nondeterministic choices at the endmarkers only. Further results on simulating unary alternating finite automata are pointed out. Our results give answers to some questions left open in the literature.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Carlo Mereghetti
    • 1
  • Giovanni Pighizzini
    • 1
  1. 1.Dipartimento di Scienze dell'InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations