Login / Signup
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen.
Zoltán Fülöp
Sándor Vágvölgyi
Published in:
Bull. EATCS (1989)
Keyphrases
</>
tree languages
tree automata
finite automata
context free
interactive theorem proving
positive data
database
data sets
training data
grammatical inference