default search action
"The Emptiness Problem for Tree Automata with at Least One Disequality ..."
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko (2014)
- Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. CoRR abs/1412.0839 (2014)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.