On cancellation properties of languages which are supports of rational power series
DOI10.1016/0022-0000(84)90026-6zbMath0578.68061OpenAlexW2008570649MaRDI QIDQ1066677
Christophe Reutenauer, Antonio Restivo
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90026-6
regular languagemorphismsfree monoidEhrenfeucht conjecturenoncommutative power seriesfinite test set
Formal languages and automata (68Q45) Valuations, completions, formal power series and related constructions (associative rings and algebras) (16W60) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (9)
Cites Work
- On binary equality sets and a solution to the test set conjecture in the binary case
- An Ogden-like iteration lemma for rational power series
- Un théorème de factorisation des produits d'endomorphismes de \(K^N\)
- Test sets and checking words for homomorphism equivalence
- On some questions of rationality and decidability
- A note on recurring series
- On the definition of a family of automata
- Sur les éléments inversibles de l'algèbre de Hadamard des séries rationnelles
- Test sets for context free languages and algebraic systems of equations over a free monoid
- Pumping Lemmas for Regular Sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On cancellation properties of languages which are supports of rational power series