Login / Signup
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.
Petr Jancar
Sylvain Schmitz
Published in:
LICS (2019)
Keyphrases
</>
equivalence relation
first order logic
higher order
natural language processing
context free
natural language
grammatical inference
decision diagrams
tree grammars
real time
background knowledge
integrity constraints
quantifier elimination
visual languages