|
|||||
|
|
Complexity of some natural problems in automatic structures |
|
| Authors: | N S Vinokurov |
| Institution: | (1) Novosibirsk State University, Russia |
| Abstract: | We prove that the automatic isomorphism problem for automatic structures, the automatic automorphism problem for an automatic structure, and the automatic embedding problem for automatic structures are $ \overset{\lower0.5em\hbox{$ \overset{\lower0.5em\hbox{ Matematicheski $ \overset{\lower0.5em\hbox{$ \overset{\lower0.5em\hbox{ Zhurnal, Vol. 46, No. 1, pp. 71–78, January–February, 2005. |
| Keywords: | finite automaton automatic structures isomorphism problem |
| 本文献已被 SpringerLink 等数据库收录！ | |