Login / Signup
Deciding Determinism of Unary Languages Is coNP-Complete.
Ping Lu
Feifei Peng
Haiming Chen
Published in:
Developments in Language Theory (2013)
Keyphrases
</>
conp complete
np complete
data complexity
expressive power
data exchange
decision problems
combined complexity
conjunctive queries
complexity theoretic
databases
special case
data mining
database
natural language
decision making
finite automata
simple examples