Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

MST
2007

favoriteEmaildiscussreport

80views more MST 2007»

The Power of Commuting with Finite Sets of Words

13 years 4 months ago

The Power of Commuting with Finite Sets of Words

Download www.math.muni.cz

We construct a ﬁnite 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.

Michal Kunc

Real-time Traffic

Largest Language | MST 2007 | Negative Answer | ﬁnite Language |

claim paper

Related Content

» Extension of Brzozowskis derivation calculus of rational expressions to series over the fr...

» Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

» Weighted Automata and Weighted Logics

» Rational Transformations of Formal Power Series

» Generation of Constants and Synchronization of Finite Automata

» Canonical finite state machines for distributed systems

» Accepting Networks of Evolutionary Processors with Subregular Filters

» Quantitative Languages

» Iterative construction of the optimal Bermudan stopping time

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MST
Authors	Michal Kunc

Comments (0)