Preview
Unable to display preview. Download preview PDF.
References
Allender E.W., Wagner K.W., Counting hierarchies: polynomial time and constant depth circuits, Bull. of the EATCS, 40, pp. 182–194, 1990
Berstel J., Reutenauer C., Rational series and their languages, Springer Verlag, 1988
Eilenberg S., Automata, Languages and Machines, Vol. 1, Academic Press, 1974
Feller W., An introduction to probability theory and its applications, Vol. 1, Wiley, 1968
Lang S., Algebra, Addison-Wesley, 1965
Niwinski D., [in “Logics and recognizable sets”, Report on the Workshop ESPRIT — ASMICS No 3166, Dersau, Germany, October 8–10, 1990], p. 24, 1990
Rabin M.O., Probabilistic automata, Inf. and Control, 6, pp. 230–245, 1963
Salomaa A., Soittola M., Automata-theoretic aspects of formal power series, Springer Verlag, 1978
Torán J., An oracle characterization of the counting hierarchy, [in “Proc. 3rd Annual Conference on Structure in Complexity Theory”], pp. 213–223, IEEE Computer Soc., Washington, 1988
Turakainen P., On probabilistic automata and their generalizations, Ann. Acad. Scient. Fennicae, Series A, 429, pp. 7–53, Helsinki, 1969.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hansel, G., Krob, D., Michaux, C. (1991). Stochastic automata and length distributions of rational languages. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_61
Download citation
DOI: https://doi.org/10.1007/3-540-54345-7_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54345-9
Online ISBN: 978-3-540-47579-8
eBook Packages: Springer Book Archive