Abstract
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.
This work was supported in part by the National Science Foundation under Grant No. MCS76-10076A01 and by "Deutsche Forschungsgemeinschaft" under Grant No. Wo334/1-1 while the second author was visiting the Pennsylvania State University.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Freivalds, R.: "Probabilistic machines can use less running time", IFIP77, North-Holland, Amsterdam, 1977, pp 839–842.
Gill, J. III: "Computational Complexity of Probabilistic Turing Machines", SIAM J. of Computing, Vol. 6, No. 4, 1977, pp 675–695.
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.
Kintala, C.M.R. and D. Wotschke: "Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata", Technical Report, 1985.
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.
Paz, A.: "Introduction to Probabilistic Automata", Academic Press, 1971.
Rabin, M.O.: "Probabilistic Algorithms", in J. Traub, Ed., Algorithms and Complexity: New Directions and Recent Results, Academic Press, 1976, pp 21–39.
Schmidt, E.M.: "Succinctness of Descriptions of Context-free, Regular, and Finite Languages", Ph. D. Dissertation, Cornell University, 1977.
Wotschke, D.: "Degree Languages: A New Concept of Acceptance", J. of Computer and System Sciences, Vol. 14, No. 2, 1977, pp 187–199.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kintala, C.M.R., Wotschke, D. (1985). Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_84
Download citation
DOI: https://doi.org/10.1007/3-540-16078-7_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16078-6
Online ISBN: 978-3-540-39758-8
eBook Packages: Springer Book Archive