Biprefix codes, inverse semigroups and syntactic monoids of injective automata (Q1060022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3905866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Biprefix codes, inverse semigroups and syntactic monoids of injective automata |
scientific article; zbMATH DE number 3905866 |
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
0 references
0 references
0.7540358304977417
0 references
0.7468358874320984
0 references
0.7468358874320984
0 references
