Advertisement

Structurally Unambiguous Finite Automata

  • Hing Leung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4094)

Abstract

We define a structurally unambiguous finite automaton (SUFA) to be a nondeterministic finite automaton (NFA) with one starting state q 0 such that for all input strings w and for any state q, there is at most one path from q 0 to q that consumes w. The definition of SUFA differs from the usual definition of an unambiguous finite automaton (UFA) in that the new definition is defined in terms of the transition logic of the finite automaton, and is independent of the choice of final states. We show that SUFA can be exponentially more succinct in the number of states than UFA and MDFA (deterministic finite automata with multiple initial states). Some interesting examples of SUFA are given. We argue that SUFA is a meaningful concept, and can have practical importance as it can implemented efficiently on synchronous models of parallel computation.

Keywords

Transition Logic Starting State Equivalence Problem Regular Language Input String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Company, San Francisco (1979)MATHGoogle Scholar
  2. 2.
    Gill, A., Kou, L.T.: Multiple-entry finite automata. J. Comput. System Sci. 9, 1–19 (1974)MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Univ. Comput. Sci. 8, 193–234 (2002)MathSciNetGoogle Scholar
  4. 4.
    Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. J. Autom. Lang. Comb. 6, 453–466 (2001)MATHMathSciNetGoogle Scholar
  5. 5.
    Kappes, M.: Descriptional complexity of deterministic finite automata with multiple initial states. J. Autom. Lang. Comb. 5, 269–278 (2000)MATHMathSciNetGoogle Scholar
  6. 6.
    Ibarra, O., Ravikumar, B.: On sparseness, ambiguity and other decision problems for acceptors and transducers. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol. 210, pp. 171–179. Springer, Heidelberg (1985)Google Scholar
  7. 7.
    Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27, 1073–1082 (1988)CrossRefGoogle Scholar
  8. 8.
    Leung, H.: Descriptional complexity of NFA of different ambiguity. International Journal of Foundations of Computer Science 16, 975–984 (2005)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Meyer, A.R., Fischer, M.: Economy of description by automata, grammars, and formal systems. In: IEEE Twelfth Annual Symposium on Switching and Automata Theory, pp. 188–191 (1971)Google Scholar
  10. 10.
    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)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Schmidt, E.M.: Succinctness of descriptions of context-free, regular and finite languages, PhD Thesis, Cornell University, Ithaca, NY (1978)Google Scholar
  12. 12.
    Stearns, R.E., Hunt, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput. 14, 598–611 (1985)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Veloso, P.A.S., Gill, A.: Some remarks on multiple-entry finite automata. J. Comput. System. Sci. 18, 304–306 (1979)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theor. Comput. Sci. 88, 325–349 (1991)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hing Leung
    • 1
  1. 1.Department of Computer ScienceNew Mexico State UniversityLas CrucesU.S.A.

Personalised recommendations