11 search results - page 1 / 3 » The Power of Commuting with Finite Sets of Words |
MST
2007
13 years 4 months ago
2007
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 1...
TCS
2008
13 years 3 months ago
2008
We introduce an extension of the derivatives of rational expressions to expressions denoting formal power series over partially commuting variables. The expressions are purely non...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
In a preceding paper [6], automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...