Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down.
Sebastian ManethHelmut SeidlPublished in: CoRR (2023)
Keyphrases
- tree languages
- context free
- turing machine
- monadic second order logic
- regular tree languages
- special case
- language learning
- high level
- finite state automaton
- tree structure
- regular languages
- finite automata
- tree automata
- binary tree
- programming language
- specification language
- regular expressions
- computational complexity
- natural language
- tree nodes
- complexity theoretic