70 search results - page 1 / 14 » Polynomial Operators on Classes of Regular Languages |
CAI
2009
Springer
13 years 11 months ago
2009
Springer
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
PLANX
2008
13 years 6 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
ITA
2007
13 years 4 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...