arXiv2
Search
Dark
/ Date
/ Name
Aa
W
/ Date
/ Name
"au:"O. Kouchnarenko"" — arXiv2 Search
Showing 1–1 of 1 results
/ Date
/ Name
Dec 2, 2014
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard