Checking in polynomial time whether or not a regular tree language is deterministic top-down.
Sebastian ManethHelmut SeidlPublished in: Inf. Process. Lett. (2024)
Keyphrases
- tree languages
- context free
- regular tree languages
- turing machine
- special case
- finite state automaton
- programming language
- language learning
- tree structure
- type checking
- natural language
- monadic second order logic
- computational complexity
- deterministic domains
- np hard
- grammatical inference
- regular languages
- conp complete
- approximation algorithms
- database languages
- tree nodes
- high level
- hierarchical structure
- index structure
- worst case
- data model
- data structure