Skip to main content
SpringerLink
Log in

Systolic tree ω-languages

  • Conference paper
  • First Online:
STACS 95 (STACS 1995)

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

Included in the following conference series:

Abstract

The class of ω-languages recognized by systolic tree automata is introduced. That class extends the class of Büchi ω-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable. A characterization of systolic tree ω-languages in terms of a (suitable) concatenation of (finitary) systolic tree languages is also provided.

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.

References

  1. Thomas, W.: Automata on Infinite Objects, Handbook of Theoretical Computer Science, Elsevier (1990), Vol. B, pp. 133–191.

    Google Scholar 

  2. Büchi, J.R.: On a Decision Method in Restricted Second Order Arithmetic, Proceedings International Congress on Logic, Methodology and Philosophy of Science, Stanford Univ. Press (1960), pp. 1–11.

    Google Scholar 

  3. Gruska, J.: Synthesis, Structure and Power of Systolic Computations, Theoretical Computer Science 71 (1990), pp. 47–78.

    Google Scholar 

  4. Culik II, K., Salomaa, A., Wood, D., Systolic Tree Acceptors, R.A.I.R.O Informatique Théorique 18 (1984), pp. 53–69.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento Scienze dell'Informazione, Università di Roma (La Sapienza), Via Salaria 113, 00198, Italy

    Angelo Monti

  2. Dipartimento di Matematica e Informatica, Università di Udine, Via Zanon 6, 33100, Italy

    Adriano Peron

Authors
  1. Angelo Monti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adriano Peron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernst W. Mayr Claude Puech

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monti, A., Peron, A. (1995). Systolic tree ω-languages. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-59042-0_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59042-2

  • Online ISBN: 978-3-540-49175-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation