217 search results - page 4 / 44 » Circuit Complexity of Regular Languages |
JUCS
2010
13 years 4 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
PODS
2010
ACM
13 years 11 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
DAC
2002
ACM
14 years 7 months ago
2002
ACM
A central problem in functional verification is to check that a circuit block is producing correct outputs while enforcing that the environment is providing legal inputs. To attac...
IANDC
2007
13 years 6 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
FSTTCS
2009
Springer
14 years 19 days ago
2009
Springer
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...