Chomsky Hierarchy And Systolic Y-Tree Automata

Authors:
Emanuela Fachini;Angelo Monti
Affiliations:
D.to di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, Via della Ricerca Scientifica, 00133 Roma, Italy, e-mail: fachini@info.utovrm.it;D.to di Scienze dell' Informazione, Università di Roma “La Sapienza”, Via Salaria 113, 00198 Roma, Italy, e-mail: monti@dsi.uniromal.it
Venue:
Fundamenta Informaticae
Year:
1997

Citing 8
Cited 0

C-tree systolic automata

Theoretical Computer Science
Synthesis, structure and power of systolic computations

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Classes of systolic Y-tree automata and a comparison with systolic trellis automata

Acta Informatica
Languages accepted by systolic Y-tree automata: structural characterizations

Acta Informatica
A kleene-like characterization of languages accepted by systolic tree automata

Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Comparisons Among Classes of Y-Tree Systolic Automata

MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Systolic Y-Tree Automata: Closure Properties and Decision Problems

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that no nonregular deterministic context-free language is accepted by any systolic Y-tree automaton while some of them, but not all, can be accepted by nondeterministic systolic Y-tree automata. We show that weak superstable systolic automata over incomplete Y-tree can accept only regular languages. We also show that the weak superstability and the superstability problems are decidable for deterministic systolic automata over a sparse and superprefix Y-tree. Moreover we prove that the regularity problem is decidable for systolic binary tree automata.