Skip to main content
SpringerLink
Log in

Multiplicity functions on ω-automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

  • 127 Accesses

Abstract

We formulate some results on Function-and Recognition Multiplicities of ω-automata.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J.R. Büchi, On a decision method in restricted second order arithmetic, Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, Stanford Univ. Press, Stanford, California, 1962, pp. 1–11.

    Google Scholar 

  2. J.R. Büchi, Decision methods in the theory of ordinals, Bull. Amer. Math. Soc. 71 (1965), 767–770.

    Google Scholar 

  3. S. Eilenberg, Automata, languages, and machines, Vol.A, Academic Press, New York, 1974.

    Google Scholar 

  4. M. Fliess, Propriétés booléennes des langages stochastiques, Math. Systems Theory 7 (1974), 353–359.

    Article  Google Scholar 

  5. J. Hartmanis and R.E. Stearns, Sets of numbers defined by finite automata, Amer. Math. Monthly 74 (1967), 539–542.

    Google Scholar 

  6. F.A. Hosch and L.H. Landweber, Finite delay solutions for sequential conditions, Proc. Symp. Automata, Languages, Programming, Paris 1972, North-Holland, Amsterdam, 1973, 45–60.

    Google Scholar 

  7. M. Karpiński, Almost deterministic ω-automata with existential output condition, Proc. Amer. Math. Soc. 53 (1975), 449–452.

    Google Scholar 

  8. M. Karpiński, Note on Multiplicity Languages, Manuscript (1975).

    Google Scholar 

  9. M. Karpiński, The Equality Problem of ω-Automata Multiplicities is Decidable, to appear.

    Google Scholar 

  10. L.H. Landweber, Decision problems for ω-automata, Math. Systems Theory 3 (1969), 376–384.

    Article  Google Scholar 

  11. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9 (1966), 521–530.

    Google Scholar 

  12. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.

    Google Scholar 

  13. M.O. Rabin, Automata on infinite objects and Church's problem, Amer. Math. Soc., Reg. Conf. Ser. Math. 13 (1972), 1–22.

    Google Scholar 

  14. M.P. Schützenberger, Certain elementary families of automata, Proc. Symp. Math. Theory of Automata, Polytechnic Institute of Brooklyn, 1962, 139–153.

    Google Scholar 

  15. M.P. Schützenberger, Parties rationnelles d'un monoïde libre, Actes Congrès Internat. Math. Nice 3 (1970), pp. 281–282, Gauthier-Villars, Paris, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Mathematical Institute of the Polish Academy of Sciences, 61725, Poznań, Poland

    Marek Karpiński

Authors
  1. Marek Karpiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karpiński, M. (1976). Multiplicity functions on ω-automata. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_233

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_233

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation