Yield-languages recognized by alternating tree recognizers
From MaRDI portal
Recommendations
Cites work
- Alternating Pushdown and Stack Automata
- Alternation
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3829259 (Why is no real title available?)
- scientific article; zbMATH DE number 3967934 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3999901 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Mappings and grammars on trees
- One-sided and two-sided context in formal grammars
Cited in
(6)- Synchronized tree automata
- scientific article; zbMATH DE number 3883631 (Why is no real title available?)
- scientific article; zbMATH DE number 3967934 (Why is no real title available?)
- scientific article; zbMATH DE number 17554 (Why is no real title available?)
- Decidability of equivalence for deterministic synchronized tree automata
- Decidability of equivalence for deterministic synchronized tree automata
This page was built for publication: Yield-languages recognized by alternating tree recognizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804222)