Searching for "Regularly Extended Two-Way Nondeterministic Tree Automata." – sorted by Relevance.
-
The Regularity of Two-Way Nondeterministic Tree Automata Languages
- establish that regularly extended two-way nondeterministic tree automata with unranked alphabets have
- Cited by 6 (4 self) – Add To MetaCart

