Paper: Some Results on Automatic Structures (at LICS 2002)

Authors: Hajime Ishihara Bakhadyr Khoussainov Sasha Rubin

Abstract

In this paper we study structures defined by finite automata, called automatic structures. We provide a method that reduces the study of automatic structures to the study of automatic graphs. We investigate isomorphism invariants of automatic structures with an emphasis to equivalence relation structures, linearly ordered sets, and permutation structures.

BibTeX

  @InProceedings{IshiharaKhoussainov-SomeResultsonAutoma,
    author = 	 {Hajime Ishihara and Bakhadyr Khoussainov and Sasha Rubin},
    title = 	 {Some Results on Automatic Structures},
    booktitle =  {Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science (LICS 2002)},
    year =	 {2002},
    month =	 {July}, 
    pages =      {235--242},
    location =   {Copenhagen, Denmark}, 
    publisher =	 {IEEE Computer Society Press}
  }