Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata

Extended abstract
  • C. M. R. Kintala
  • Detlef Wotschke
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)


The conciseness of degree automata (nondeterministic finite automata with a specified acceptance degree) and probabilistic automata over both nondeterministic and deterministic finite automata is investigated. In particular, we exhibit a class of languages for which degree automata are at least polynomially more concise than the equivalent nondeterministic automata. We show that there is no function which bounds the conciseness of probabilistic automata with isolated cutpoints over nondeterministic or degree automata. The concurrent conciseness of probabilistic automata and degree automata over nondeterministic and deterministic automata is also studied.


Finite Automaton Deterministic Finite Automaton Deterministic Automaton Probabilistic Automaton Exclamation Mark 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Freivalds, R.: "Probabilistic machines can use less running time", IFIP77, North-Holland, Amsterdam, 1977, pp 839–842.Google Scholar
  2. [2]
    Gill, J. III: "Computational Complexity of Probabilistic Turing Machines", SIAM J. of Computing, Vol. 6, No. 4, 1977, pp 675–695.Google Scholar
  3. [3]
    Gill, J. III, H. Hunt, and J. Simon: "Deterministic Simulation of Probabilistic Turing Machine Transducers", Theoretical Computer Science, Vol. 12, No. 3, 1980, pp 333–338.Google Scholar
  4. [4]
    Kintala, C.M.R. and D. Wotschke: "Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata", Technical Report, 1985.Google Scholar
  5. [5]
    Meyer, A.R. and M.J. Fischer: "Economy of Description by Automata, Grammars and Formal Systems", Proc. of the 12th IEEE Symp. on Switching and Automata Theory, 1971, pp 188–190.Google Scholar
  6. [6]
    Paz, A.: "Introduction to Probabilistic Automata", Academic Press, 1971.Google Scholar
  7. [7]
    Rabin, M.O.: "Probabilistic Algorithms", in J. Traub, Ed., Algorithms and Complexity: New Directions and Recent Results, Academic Press, 1976, pp 21–39.Google Scholar
  8. [8]
    Schmidt, E.M.: "Succinctness of Descriptions of Context-free, Regular, and Finite Languages", Ph. D. Dissertation, Cornell University, 1977.Google Scholar
  9. [9]
    Wotschke, D.: "Degree Languages: A New Concept of Acceptance", J. of Computer and System Sciences, Vol. 14, No. 2, 1977, pp 187–199.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • C. M. R. Kintala
    • 1
  • Detlef Wotschke
    • 2
  1. 1.AT&T Bell LaboratoriesMurray HillU.S.A.
  2. 2.Fachbereich InformatikJ. W. Goethe-UniversitätFrankfurt/MainWest-Germany

Personalised recommendations