70 search results - page 5 / 14 » Polynomial Operators on Classes of Regular Languages |
116
Voted
DNA
2007
Springer
15 years 9 months ago
2007
Springer
We consider theoretical properties of the template-guided recombination operation. In particular, we consider the decidability of whether two sets of templates are equivalent, that...
110
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
139
click to vote
JMLR
2010
14 years 10 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
140
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
95
Voted
LACL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...