Displaying 1181 – 1200 of 2186

Showing per page

On related transducers

Petr Lisoněk (1990)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

On Sequences Defined by D0L Power Series

Juha Honkala (2010)

RAIRO - Theoretical Informatics and Applications

We study D0L power series over commutative semirings. We show that a sequence (cn)n≥0 of nonzero elements of a field A is the coefficient sequence of a D0L power series if and only if there exist a positive integer k and integers βi for 1 ≤ i ≤ k such that c n + k = c n + k - 1 β 1 c n + k - 2 β 2 ... c n β k for all n ≥ 0. As a consequence we solve the equivalence problem of D0L power series over computable fields.

On shuffle ideals

Pierre-Cyrille Héam (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A shuffle ideal is a language which is a finite union of languages of the form A * a 1 A * A * a k A * where A is a finite alphabet and the a i ’s are letters. We show how to represent shuffle ideals by special automata and how to compute these representations. We also give a temporal logic characterization of shuffle ideals and we study its expressive power over infinite words. We characterize the complexity of deciding whether a language is a shuffle ideal and we give a new quadratic algorithm for this problem. Finally...

On Shuffle Ideals

Pierre-Cyrille Héam (2010)

RAIRO - Theoretical Informatics and Applications


A shuffle ideal is a language which is a finite union of languages of the form A*a1A*...A*ak where A is a finite alphabet and the ai's are letters. We show how to represent shuffle ideals by special automata and how to compute these representations. We also give a temporal logic characterization of shuffle ideals and we study its expressive power over infinite words. We characterize the complexity of deciding whether a language is a shuffle ideal and we give a new quadratic algorithm for...

Currently displaying 1181 – 1200 of 2186