Advertisement

Unary NFAs with Limited Nondeterminism

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8327)

Abstract

We consider unary finite automata employing limited nondeterminism. We show that for a unary regular language, a minimal finite tree width nondeterministic finite automaton (NFA) can always be found in Chrobak normal form. A similar property holds with respect to other measures of nondeterminism. The latter observation is used to establish relationships between classes of unary regular languages recognized by NFAs of given size where the nondeterminism is limited in various ways. Finally, we show that the branching measure of a unary NFA is always either bounded by a constant or has an exponential growth rate.

Keywords

finite automata limited nondeterminism state complexity unary regular languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Björklund, H., Martens, W.: The tractability frontier for nfa minimization. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 27–38. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Bondy, J., Murty, U.: Graph theory. Graduate texts in mathematics, vol. 244. Springer (2008)Google Scholar
  3. 3.
    Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47(3), 149–158 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Gawrychowski, P.: Chrobak normal form revisited, with applications. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 142–153. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Gill, A., Kou, L.T.: Multiple-entry finite automata. J. Comput. Syst. Sci. 9(1), 1–19 (1974)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS 8(2), 193–234 (2002)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Inf. Comput. 86(2), 179–194 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Holzer, M., Kutrib, M.: Nondeterministic finite automata - recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20(4), 563–580 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inf. Comput. 209(3), 456–470 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Hromkovič, J., Karhumäki, J., Klauck, H., Schnitger, G., Seibert, S.: Measures of nondeterminism in finite automata. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 199–210. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Hromkovic, J., Seibert, S., Karhumäki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inf. Comput. 172(2), 202–217 (2002)CrossRefzbMATHGoogle Scholar
  12. 12.
    Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal nfa’s over a unary alphabet. In: Biswas, S., Nori, K.V. (eds.) FSTTCS 1991. LNCS, vol. 560, pp. 152–171. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  13. 13.
    Kappes, M.: Descriptional complexity of deterministic finite automata with multiple initial states. Journal of Automata, Languages and Combinatorics 5(3), 269–278 (2000)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Kintala, C.M.R., Wotschke, D.: Amounts of nondeterminism in finite automata. Acta Inf. 13, 199–204 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Leung, H.: On finite automata with limited nondeterminism. Acta Inf. 35(7), 595–624 (1998)CrossRefzbMATHGoogle Scholar
  16. 16.
    Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073–1082 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Lupanov, O.B.: A comparison of two types of finite sources. Problemy Kibernetiki 9, 328–335 (1963)Google Scholar
  18. 18.
    Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT (FOCS), pp. 188–191. IEEE Computer Society (1971)Google Scholar
  19. 19.
    Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transactions on Computers C-20(10), 1211–1214 (1971)CrossRefGoogle Scholar
  20. 20.
    Palioudakis, A., Salomaa, K., Akl, S.G.: State complexity and limited nondeterminism. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 252–265. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  21. 21.
    Palioudakis, A., Salomaa, K., Akl, S.G.: Comparisons between measures of nondeterminism on finite automata. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 217–228. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  22. 22.
    Palioudakis, A., Salomaa, K., Akl, S.G.: Finite nondeterminism vs. dfas with multiple initial states. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 229–240. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  23. 23.
    Ravikumar, B., Ibarra, O.H.: Relating the type of ambiguity of finite automata to the succinctness of their representation. SIAM J. Comput. 18(6), 1263–1282 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Shallit, J.O.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)Google Scholar
  25. 25.
    Yu, S.: Regular Languages. In: Handbook of Formal Languages, vol. 1, pp. 41–110. Springer (1998)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.School of ComputingQueen’s UniversityKingstonCanada

Personalised recommendations