205 search results - page 2 / 41 » Testing the Equivalence of Regular Languages |
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
MFCS
2005
Springer
15 years 2 months ago
2005
Springer
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
INFORMATICALT
2000
14 years 9 months ago
2000
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...