Sciweavers

JUCS
2010
129views more  JUCS 2010»
13 years 7 months ago
Orthogonal Concatenation: Language Equations and State Complexity
: 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...
Mark Daley, Michael Domaratzki, Kai Salomaa
FCSC
2010
108views more  FCSC 2010»
13 years 8 months ago
On the computation of quotients and factors of regular languages
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...
Mircea Marin, Temur Kutsia
MFCS
2005
Springer
14 years 2 months ago
Strict Language Inequalities and Their Decision Problems
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
Alexander Okhotin
DATE
2005
IEEE
97views Hardware» more  DATE 2005»
14 years 3 months ago
Efficient Solution of Language Equations Using Partitioned Representations
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...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...