On the Computational Completeness of Equations over Sets of Natural Numbers
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Length Codes, Products of Languages and Primality
Language and Automata Theory and Applications
Theoretical Computer Science
Conjugacy of finite biprefix codes
Theoretical Computer Science
A decision procedure for subset constraints over regular languages
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Simple equations on binary factorial languages
Theoretical Computer Science
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Variants of codes and indecomposable languages
Information and Computation
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Computational power of two stacks with restricted communication
Information and Computation
Solving string constraints lazily
Proceedings of the IEEE/ACM international conference on Automated software engineering
On language equations XXK = XXL and XM = N over a unary alphabet
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Language equations with complementation: Expressive power
Theoretical Computer Science
On the expressive power of univariate equations over sets of natural numbers
Information and Computation
Equations x+a=b and (x+x)+c=(x−x)+d over sets of natural numbers
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
The simplest language where equivalence of finite substitutions is undecidable
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1971 and also strongly disproves Conway's conjecture on context-freeness of maximal solutions of systems of semi-linear inequalities.