4 search results - page 1 / 1 » The Fooling Set Problem for Unary Regular Language Is in NP |
FSKD
2008
Springer
13 years 5 months ago
2008
Springer
JALC
2007
13 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...