Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1991: Mathematical Foundations of Computer Science 1991 pp 181–190Cite as

Stochastic automata and length distributions of rational languages

  • Contributions
  • Conference paper
  • First Online:

  • 133 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 520))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allender E.W., Wagner K.W., Counting hierarchies: polynomial time and constant depth circuits, Bull. of the EATCS, 40, pp. 182–194, 1990

    Google Scholar 

  2. Berstel J., Reutenauer C., Rational series and their languages, Springer Verlag, 1988

    Google Scholar 

  3. Eilenberg S., Automata, Languages and Machines, Vol. 1, Academic Press, 1974

    Google Scholar 

  4. Feller W., An introduction to probability theory and its applications, Vol. 1, Wiley, 1968

    Google Scholar 

  5. Lang S., Algebra, Addison-Wesley, 1965

    Google Scholar 

  6. Niwinski D., [in “Logics and recognizable sets”, Report on the Workshop ESPRIT — ASMICS No 3166, Dersau, Germany, October 8–10, 1990], p. 24, 1990

    Google Scholar 

  7. Rabin M.O., Probabilistic automata, Inf. and Control, 6, pp. 230–245, 1963

    Google Scholar 

  8. Salomaa A., Soittola M., Automata-theoretic aspects of formal power series, Springer Verlag, 1978

    Google Scholar 

  9. 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

    Google Scholar 

  10. Turakainen P., On probabilistic automata and their generalizations, Ann. Acad. Scient. Fennicae, Series A, 429, pp. 7–53, Helsinki, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Rouen — Laboratoire d'Informatique de Rouen, Place Blondel, 76134, Mont Saint-Aignan Cedex, France

    Georges Hansel

  2. Université de Rouen and CNRS(LITP) — Laboratoire d'Informatique de Rouen, Université Paris 6, Place Blondel, 76134, Mont Saint-Aignan Cedex, France

    Daniel Krob

  3. Université de Mons-Hainaut, 15, Avenue Maistriau, B 7000, Mons, Belgique

    Christian Michaux

Authors
  1. Georges Hansel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Krob
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Michaux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation