164 search results - page 1 / 33 » Quotient Complexity of Regular Languages |
CORR
2009
Springer
13 years 8 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
FCSC
2010
13 years 9 months ago
2010
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
ADBIS
2009
Springer
14 years 5 months ago
2009
Springer
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
CIE
2007
Springer
14 years 5 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...