1052 search results - page 40 / 211 » The Regular Real-Time Languages |
187
Voted
LATA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
143
Voted
IANDC
2007
15 years 3 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...
118
Voted
FCSC
2010
15 years 2 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...
126
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
117
Voted
CIE
2007
Springer
15 years 9 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...