Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Regular expressions for infinite trees and a standard form of automata

  • Conference paper
  • First Online:
Computation Theory (SCT 1984)

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

Included in the following conference series:

Abstract

For Rabin pair automata [R1] a standard form is defined /def. 2/ i.e. such that an ordered subset {s1,...,s2I-1} of states is distinguished in such a way that a path of a run is accepting /rejecting if for some i even/ odd, 1≤i≤2I-1, the si appears infinitely often, and all sj, j<i only finitely many times. The class of standard automata is big enough to represent all f.a. representable sets /th.1/ but has many properties similar to special automata defined in [R1]. A standard regular expression is defined /def. 6/ describing a process of forming of an infinite tree, as well as a process of building of an automaton /analysis and synthesis theorems 3,4/. The standard regular expressions are a generalisation of McNaughtons formula v d

. [N] /.

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.

4. Bibiography

  1. Karpiński M., Decidability of the weak definiability in the s2s theories. 3-d symposium of MFCS, Zaborów, January 21–26 1980, ICS PAS Reports 411 p.47–48.

    Google Scholar 

  2. McNaughton R., Testing and generating infinite sequences by a finite trees and inequalities between various Rabin pair indices, Information processing letters 15 1983, pl.59–163

    Google Scholar 

  3. Mostowski A.W., Classes of automata of a given Rabin pair index. Proceedings of workshop on algorithms and computing theory, September 7–10,1981 ed. by M.Karpiński and Z.Habasiński, Poznań 1981.

    Google Scholar 

  4. Mostowski A.W., On differences on automata on infinite trees and those on sequences, Report on the 1-st GTI Workshop, Lutz Prietze ed. Universitat Padderborn, Reiche Teoretische Informatik Marz 1982.

    Google Scholar 

  5. Rabin M.O., Decidability and definiability in Second-order Theories, Actes Congress Intern. Math., 1970 Tome 1 p.239–244.

    Google Scholar 

  6. Rabin M.O., Weakly definiable relations and special automata. Math.Logic Foundations Set Theory, North Holland 1970 p.1–23.

    Google Scholar 

  7. Thatcher J.W. Wright J.B., Generalised Finite Automata Theory with an Application to Second-order Logic. Math. Systems Theory, vol.2, p.57–81.

    Google Scholar 

  8. Wagner K., On ω-regular Sets. Information and Control 43 1979, p.123–177.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math.Institute of the University of Gdańsk, Wita Stwosza 57, 80-952, Gdańsk, Poland

    A. W. Mostowski

Authors
  1. A. W. Mostowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mostowski, A.W. (1985). Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-16066-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16066-3

  • Online ISBN: 978-3-540-39748-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation