JUCS
2010
13 years 7 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...
FCSC
2010
13 years 8 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...
MFCS
2005
Springer
14 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...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...