Complexity of some natural problems in automatic structures.
Sibirskij Matematicheskij Zhurnal (2005)
- Volume: 46, Issue: 1, page 71-78
- ISSN: 0037-4474
Access Full Article
top
How to cite
topVinokurov, N.S.. "Complexity of some natural problems in automatic structures.." Sibirskij Matematicheskij Zhurnal 46.1 (2005): 71-78. <http://eudml.org/doc/52660>.
@article{Vinokurov2005,
author = {Vinokurov, N.S.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {finite automaton; automatic structure; isomorphism problem; embeddability problem; automatic automorphism},
language = {eng},
number = {1},
pages = {71-78},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {Complexity of some natural problems in automatic structures.},
url = {http://eudml.org/doc/52660},
volume = {46},
year = {2005},
}
TY - JOUR
AU - Vinokurov, N.S.
TI - Complexity of some natural problems in automatic structures.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2005
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 46
IS - 1
SP - 71
EP - 78
LA - eng
KW - finite automaton; automatic structure; isomorphism problem; embeddability problem; automatic automorphism
UR - http://eudml.org/doc/52660
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.