Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Benjamin Blanchette"'
Autor:
Benjamin Blanchette
Publikováno v:
Theoretical Computer Science. 793:193-195
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a quasi-automatic semigr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::992f0dfb7f4ed2b2c4b3447c1c0568ca
https://doi.org/10.1016/j.tcs.2019.05.026
https://doi.org/10.1016/j.tcs.2019.05.026
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a rational relat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1015dc36f373d048d5bbb4244b28e2c8
