Login / Signup
Bisimulation equivalence of first-order grammars is Ackermann-hard.
Petr Jancar
Published in:
CoRR (2013)
Keyphrases
</>
equivalence relation
higher order
context free
decision diagrams
first order logic
natural language
context free grammars
quantifier elimination
natural language processing
neural network
optimal planning
phrase structure
stochastic dominance