Inverse automata andmonoids and the undecidability of the cayley subgraph problem for groups
Glasgow mathematical journal, Tome 42 (2000) no. 3, pp. 421-437
Voir la notice de l'article provenant de la source Cambridge University Press
The structure of an inverse monoid can bedetermined by the complete set of Schützenberger graphs of a presentation. Necessary andsufficient conditions for a collection of inverse X-graphs to be the complete set ofSchützenberger graphs of some inverse monoid presentation are established and decidabilityresults are obtained. Conditions for a single inverse X-graph to be a Schu ̈tzenbergergraph for some presentation are also obtained, and both problems are restricted to the case ofClifford monoids and E-unitary inverse monoids. Decidability and undecidability results are obtainedfor the case of finite graphs. It is also proved that the problem of embedding a finite inverseX-graph in the Cayley graph of a group is undecidable.
Oliveira, Ana; Silva, Pedro V. Inverse automata andmonoids and the undecidability of the cayley subgraph problem for groups. Glasgow mathematical journal, Tome 42 (2000) no. 3, pp. 421-437. doi: 10.1017/S001708950003010X
@article{10_1017_S001708950003010X,
author = {Oliveira, Ana and Silva, Pedro V.},
title = {Inverse automata andmonoids and the undecidability of the cayley subgraph problem for groups},
journal = {Glasgow mathematical journal},
pages = {421--437},
year = {2000},
volume = {42},
number = {3},
doi = {10.1017/S001708950003010X},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S001708950003010X/}
}
TY - JOUR AU - Oliveira, Ana AU - Silva, Pedro V. TI - Inverse automata andmonoids and the undecidability of the cayley subgraph problem for groups JO - Glasgow mathematical journal PY - 2000 SP - 421 EP - 437 VL - 42 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.1017/S001708950003010X/ DO - 10.1017/S001708950003010X ID - 10_1017_S001708950003010X ER -
%0 Journal Article %A Oliveira, Ana %A Silva, Pedro V. %T Inverse automata andmonoids and the undecidability of the cayley subgraph problem for groups %J Glasgow mathematical journal %D 2000 %P 421-437 %V 42 %N 3 %U http://geodesic.mathdoc.fr/articles/10.1017/S001708950003010X/ %R 10.1017/S001708950003010X %F 10_1017_S001708950003010X
Cité par Sources :