Rational languages and the Burnside problem
From MaRDI portal
Publication:1079380
DOI10.1016/0304-3975(85)90156-2zbMath0597.68057OpenAlexW2008364849MaRDI QIDQ1079380
Antonio Restivo, Christophe Reutenauer
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90156-2
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) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to group theory (20-02)
Related Items
Applications of an infinite square-free co-CFL, Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, A characterization of rational star languages generated by strong codes, Some combinatorial properties of infinite words and applications to semigroup theory, Unavoidable regularities in long words with bounded number of symbol occurrences, Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata, On isomorphism testing of a class of 2-nilpotent groups, Finiteness and iteration conditions for semigroups, Generalized cancellation-and-permutation properties, regular languages and supports of rational series, Word problem for knotted residuated lattices., Enumeration of factors in the Thue-Morse word, Monomial algebras
Cites Work
- On regularity of context-free languages
- On the Burnside problem for semigroups
- Commutative one-counter languages are regular
- On cancellation properties of languages which are supports of rational power series
- On commutative context-free languages
- A decision procedure for the order of regular events
- Cônes rationnels commutatifs
- Rational bijection of rational sets
- Series formelles et algèbres syntactiques
- The Burnside problem for semigroups
- On some questions of rationality and decidability
- On finite semigroups of matrices
- La finitude des représentations linéaires des semi-groupes est decidable
- Substitution and bounded languages
- Classification of noncounting events
- Unending chess, symbolic dynamics and a problem in semi-groups
- SOLUTION OF THE BURNSIDE PROBLEM FOR EXPONENT 6
- On the definition of a family of automata
- Sur les éléments inversibles de l'algèbre de Hadamard des séries rationnelles
- Some applications of a theorem of Shirshov to language theory
- Pumping Lemmas for Regular Sets
- Every commutative quasirational language is regular
- A translational theorem for the class of EOL languages
- INFINITE PERIODIC GROUPS. I
- Finite counting automata
- A finiteness condition for finitely generated semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
