Biprefix codes, inverse semigroups and syntactic monoids of injective automata (Q1060022): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:04, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Biprefix codes, inverse semigroups and syntactic monoids of injective automata |
scientific article |
Statements
Biprefix codes, inverse semigroups and syntactic monoids of injective automata (English)
0 references
1984
0 references
The author proves some properties of automata and semigroups. He shows that each injective automaton may be simulated by the minimal automaton of a language of the form \(B^*\), B a finite biprefix code. A similar result holds for any automaton, with ''biprefix'' replaced by ''prefix''. Finally, he investigates the form of injective automata which accept subsemigrous.
0 references