La représentation ergodique d'un automate fini

DOI10.1016/0304-3975(79)90026-4zbMath0422.68022OpenAlexW2079706174MaRDI QIDQ1133897

Dominique Perrin

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90026-4

zbMATH Keywords

reversible automatonergodic representationfinite languages which are both prefix and suffixmatrix representation of the semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

A graph covering construction of all the finite complete biprefix codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Le degré minimal du groupe d'un code biprefixe fini
• La transitivite du groupe d'un code biprefixe fini
• Codes asynchrones
• Sur certains sous-monoïdes libres
• The Theory of Definite Automata
• Sur un algorithme donnant les codes bipréfixes finis
• On a Special Class of Recurrent Events

This page was built for publication: La représentation ergodique d'un automate fini