Systolic tree ω-languages

  • Angelo Monti
  • Adriano Peron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 900)


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.


Equivalence Class Infinite Sequence Regular Language Sequential Calculus Finite Union 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Thomas, W.: Automata on Infinite Objects, Handbook of Theoretical Computer Science, Elsevier (1990), Vol. B, pp. 133–191.Google Scholar
  2. 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. 3.
    Gruska, J.: Synthesis, Structure and Power of Systolic Computations, Theoretical Computer Science 71 (1990), pp. 47–78.Google Scholar
  4. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Angelo Monti
    • 1
  • Adriano Peron
    • 2
  1. 1.Dipartimento Scienze dell'InformazioneUniversità di Roma (La Sapienza)Italy
  2. 2.Dipartimento di Matematica e InformaticaUniversità di UdineItaly

Personalised recommendations