Algorithmica

, Volume 63, Issue 3, pp 571–587 | Cite as

Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata

Article

Abstract

For each sufficiently large n, there exists a unary regular language L such that both L and its complement Lc are accepted by unambiguous nondeterministic automata with at most n states, while the smallest deterministic automata for these two languages still require a superpolynomial number of states, at least \(e^{\Omega(\sqrt[3]{n\cdot\ln^{2}n})}\). Actually, L and Lc are “balanced” not only in the number of states but, moreover, they are accepted by nondeterministic machines sharing the same transition graph, differing only in the distribution of their final states. As a consequence, the gap between the sizes of unary unambiguous self-verifying automata and deterministic automata is also superpolynomial.

Keywords

Finite state automata State complexity Unary regular languages Unary automata 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anselmo, M., Madonia, M.: Some results on the structure of unary unambiguous automata. Adv. Appl. Math. (2010). doi:10.1016/j.aam.2010.05.003 Google Scholar
  2. 2.
    Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47, 149–158 (1986). Corrigendum: ibid. 302, 497–498 (2003) MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Ďuriš, P., Hromkovič, J., Rolim, J., Schnitger, G.: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. In: Proceedings of Symposium on Theoretical Aspects of Computer Science 1997. LNCS, vol. 1200, pp. 117–128. Springer, Berlin (1997) Google Scholar
  4. 4.
    Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205, 1652–1670 (2007) MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Grantham, J.: The largest prime dividing the maximal order of an element of S n. Math. Comput. 64, 407–410 (1995) MathSciNetMATHGoogle Scholar
  6. 6.
    Hromkovič, J., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Inf. Comput. 169, 284–296 (2001) MATHCrossRefGoogle Scholar
  7. 7.
    Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal nfa’s over a unary alphabet. Int. J. Found. Comput. Sci. 2, 163–182 (1991) MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Jirásková, G., Pighizzini, G.: Converting self-verifying automata into deterministic automata. In: Proceedings of Language and Automata Theory and Applications 2009. LNCS, vol. 5457, pp. 458–468. Springer, Berlin (2009) CrossRefGoogle Scholar
  9. 9.
    Landau, E.: Über die Maximalordnung der Permutation gegebenen Grades. Arch. Math. Phys. 3, 92–103 (1903) Google Scholar
  10. 10.
    Landau, E.: Handbuch der Lehre von der Verteilung der Primzahlen I. Teubner, Leipzig/Berlin (1909) Google Scholar
  11. 11.
    Ljubič, Ju.I.: Bounds for the optimal determinization of nondeterministic autonomous automata. Sib. Mat. Zh. V/2, 337–355 (1964) (in Russian) Google Scholar
  12. 12.
    Lupanov, O.B.: A comparison of two types of finite automata. Probl. Kibern. 9, 321–326 (1963) (in Russian). German translation: Über den Vergleich zweier Typen endlicher Quellen. Probleme der Kybernetik 6, 329–335 (1966) Google Scholar
  13. 13.
    Mandl, R.: Precise bounds associated with the subset construction of various classes of nondeterministic finite automata. In: Proceedings of 7th Princeton Conference of Information and System Sciences, pp. 263–267 (1973) Google Scholar
  14. 14.
    Mera, F., Pighizzini, G.: Complementing unary nondeterministic automata. Theor. Comput. Sci. 330, 349–360 (2005) MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Mereghetti, C., Pighizzini, G.: Optimal simulations between unary automata. SIAM J. Comput. 30, 1976–1992 (2001) MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proceedings of 12th Annual IEEE Symposium on Switching and Automata Theory, pp. 188–191 (1971) CrossRefGoogle Scholar
  17. 17.
    Miller, W.: The maximum order of an element of a finite symmetric group. Am. Math. Mon. 94, 497–506 (1987) MATHCrossRefGoogle Scholar
  18. 18.
    Moore, F.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. C-20(10), 1211–1214 (1971) CrossRefGoogle Scholar
  19. 19.
    Nicolas, J.-L.: Sur l’ordre maximum d’un élément dans le groupe S n des permutations. Acta Arith. 14, 315–332 (1968) MathSciNetMATHGoogle Scholar
  20. 20.
    Okhotin, A.: Unambiguous finite automata over a unary alphabet. In: Proceedings of Mathematical Foundations of Computer Science 2010. LNCS, vol. 6281, pp. 556–567. Springer, Berlin (2010) CrossRefGoogle Scholar
  21. 21.
    Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959) MathSciNetCrossRefGoogle Scholar
  22. 22.
    Ramanujan, S.: A proof of Bertrand’s postulate. J. Indian Math. Soc. 11, 181–182 (1919) Google Scholar
  23. 23.
    Ravikumar, B., Ibarra, O.: Relating the type of ambiguity of finite automata to the succinctness of their representation. SIAM J. Comput. 18, 1263–1282 (1989) MathSciNetMATHCrossRefGoogle Scholar
  24. 24.
    Szalay, M.: On the maximal order in S n and \(S_{n}^{*}\). Acta Arith. 37, 321–331 (1980) MathSciNetMATHGoogle Scholar
  25. 25.
    To, A.W.: Unary finite automata vs. arithmetic progressions. Inf. Process. Lett. 109, 1010–1014 (2009) MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceP. J. Šafárik UniversityKošiceSlovakia
  2. 2.Dipartimento di Informatica e ComunicazioneUniversità degli Studi di MilanoMilanItaly

Personalised recommendations