Yield-languages recognized by alternating tree recognizers
From MaRDI portal
Publication:3804222
DOI10.1051/ita/1988220303191zbMath0656.68087MaRDI QIDQ3804222
Publication date: 1988
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92311
formal languages; tree automata; tree language; context- sensitive language; alternating computations; yield-language
68Q45: Formal languages and automata
Related Items
Decidability of equivalence for deterministic synchronized tree automata, Synchronized tree automata