The finite power property in free groups

Authors:
Flavio d'Alessandro;Jacques Sakarovitch
Affiliations:
Dipartimento di matematica, Università degli Studi di Napoli - Federico II, Italy;Laboratoire Traitement et Communication de l'Information, E.N.S.T./C.N.R.S., Paris, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 5
Cited 2

On the complexity of some extended word problems defined by cancellation rules

Information Processing Letters
Rational series and their languages

Rational series and their languages
Improved limitedness theorems on finite automata with distance functions

Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Automata, Languages, and Machines

Automata, Languages, and Machines
Recognizable Sets with Multiplicities in the Tropical Semiring

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988

On the complexity of Simon automata over the Dyck language

Journal of Automata, Languages and Combinatorics
Algebraic characterization of the finite power property

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	5.23

Visualization

Abstract

For the two-sided homogeneous linear equation system A ⊗ x = B ⊗ y over (max, +), with no infinite rows or columns in A or B, an algorithm is presented which converges to a finite solution from any finite starting point ...