Handbook of Formal Languages
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Unification in a Description Logic with Transitive Closure of Roles
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
The Complexity of Set Constraints
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Computation: finite and infinite machines
Computation: finite and infinite machines
Theoretical Computer Science - The art of theory
Regular solutions of language inequalities and well quasi-orders
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Decision problems for language equations with Boolean operations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Language equations with complementation: Decision problems
Theoretical Computer Science
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Language equations with complementation: Expressive power
Theoretical Computer Science
Language equations with complementation
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
It is known that for a regular language L and an arbitrary language K the largest solution of the inequality XK⊆LX is regular. Here we show that there exist finite languages K and P and star-free languages L, M and R such that the largest solutions of the systems $\{XK\subseteq LX,\ X\subseteq M\}$ and $\{XK\subseteq LX,\ XP\subseteq RX\}$ are not recursively enumerable.