Login / Signup
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton.
Mikolaj Bojanczyk
Published in:
CoRR (2017)
Keyphrases
</>
regular tree languages
tree automata
tree languages
regular expressions
finite automata
finite state
xml schema
ordered trees
context free grammars
sufficient conditions
database
xml documents
markov chain
context free