Biprefix codes, inverse semigroups and syntactic monoids of injective automata (Q1060022): Difference between revisions

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

reviewed by

Christophe Reutenauer

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0304-3975(84)90031-8

0 references

0 references

0 references

0 references

0 references

Semigroups satisfying minimal conditions II

0 references

Q4126563

0 references

On certain codes admitting inverse semigroups as syntactic monoids

0 references

Q3853827

0 references

On the syntactic transformation semigroup of a language generated by a finite biprefix code

0 references

Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini

0 references

On varieties of rational languages and variable-length codes

0 references

Addendum to `Representations of inverse semigroups by one-to-one partial transformations of a set'

0 references

Sur mon article ''Une topologie du monoide libre''

0 references

Q5822089

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1060022

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(84)90031-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2003635352
@@ Property / OpenAlex ID: W2003635352 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114214850
@@ Property / Wikidata QID: Q114214850 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3848243
@@ Property / cites work: Q3848243 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Semigroups satisfying minimal conditions II
@@ Property / cites work: Semigroups satisfying minimal conditions II / rank @@
+Normal rank
@@ Property / cites work @@
+Q4126563
@@ Property / cites work: Q4126563 / rank @@
+Normal rank
@@ Property / cites work @@
+On certain codes admitting inverse semigroups as syntactic monoids
+Normal rank
@@ Property / cites work @@
+Q3853827
@@ Property / cites work: Q3853827 / rank @@
+Normal rank
@@ Property / cites work @@
+On the syntactic transformation semigroup of a language generated by a finite biprefix code
+Normal rank
@@ Property / cites work @@
+Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
+Normal rank
@@ Property / cites work @@
+On varieties of rational languages and variable-length codes
+Normal rank
@@ Property / cites work @@
+Addendum to `Representations of inverse semigroups by one-to-one partial transformations of a set'
+Normal rank
@@ Property / cites work @@
+Sur mon article ''Une topologie du monoide libre''
+Normal rank
@@ Property / cites work @@
+Q5822089
@@ Property / cites work: Q5822089 / rank @@
+Normal rank