La représentation ergodique d'un automate fini

DOI10.1016/0304-3975(79)90026-4MaRDI QIDQ1133897zbMATH OpenOpenAlexFDO

Authors 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

ergodic representationfinite languages which are both prefix and suffixmatrix representation of the semigroupreversible automaton

Mathematics Subject Classification ID

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

Cites work

• Codes asynchrones
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3512409 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3608316 (Why is no real title available?)
• scientific article; zbMATH DE number 3203853 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• scientific article; zbMATH DE number 3354928 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• La transitivite du groupe d'un code biprefixe fini
• Le degré minimal du groupe d'un code biprefixe fini
• On a Special Class of Recurrent Events
• Sur certains sous-monoïdes libres
• Sur un algorithme donnant les codes bipréfixes finis
• The Theory of Definite Automata

Cited in

(1)

• A graph covering construction of all the finite complete biprefix codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133897)