Login / Signup
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Emanuela Fachini
Andrea Maggiolo-Schettini
Giovanni Resta
Davide Sangiorgi
Published in:
Theor. Comput. Sci. (1991)
Keyphrases
</>
closure properties
tree automata
regular expressions
finite automata
finite state
tree languages
regular tree languages
expressive power
context free grammars
markov chain
context free
query language
metadata
reinforcement learning
state space
grammatical inference