Model Theoretic Complexity of Automatic Structures (Extended Abstract)-Reference-Cited by-同舟云学术

Model Theoretic Complexity of Automatic Structures (Extended Abstract)

Published: Issue: Volume: Page:514-525
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Khoussainov Bakhadyr,Minnes Mia

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79228-4_45.pdf

Reference25 articles.

1. Benedikt, M., Libkin, L.: Tree extension algebras: Logics, automata, and query languages. In: Proceedings of LICS 2002, pp. 203–212 (2002)

2. Bennett, C.H.: Logical Reversibility of Computation. IBM Journal of Research and Development, 525–532 (1973)

3. Blaas, A., Gurevich, Y.: Program Termination and Well Partial Orderings. ACM Transactions on Computational Logic, 1–25 (2006)

4. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift Math. Logik und Grundlagen det Mathematik, 66–92 (1960)

5. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Nagel, E., Suppes, P., Tarski, A. (eds.) Proc. International Congress on Logic, Methodology and Philosophy of Science, 1960, pp. 1–12. Stanford University Press (1962)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The isomorphism problem on classes of automatic structures with transitive relations;Transactions of the American Mathematical Society;2013-05-20

2. The Isomorphism Problem on Classes of Automatic Structures;2010 25th Annual IEEE Symposium on Logic in Computer Science;2010-07

3. Some natural decision problems in automatic graphs;The Journal of Symbolic Logic;2010-06

4. 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09;The Bulletin of Symbolic Logic;2010-03