Finitely generated semiautomatic groups-Reference-Cited by-同舟云学术

Finitely generated semiautomatic groups

Published:2018-06-07 Issue:2-3 Volume:7 Page:273-287
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Jain Sanjay¹,Khoussainov Bakhadyr²,Stephan Frank³

Affiliation:

1. Department of Computer Science, National University of Singapore, 13 Computing Drive, COM1, Singapore 117417, Republic of Singapore. sanjay@comp.nus.edu.sg

2. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand. bmk@cs.auckland.ac.nz

3. Department of Mathematics and Department of Computer Science, National University of Singapore, 10 Lower Kent Ridge Road, S17, Singapore 119076, Republic of Singapore. fstephan@comp.nus.edu.sg

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference19 articles.

1. Post’s programme for the Ershov hierarchy;Afshari;Journal of Logic and Computation,2007

2. D. Berdinsky and B. Khoussainov, On automatic transitive graphs, in: Developments in Language Theory – Eighteenth International Conference, DLT 2014, Proceedings, Ekaterinburg, Russia, August 26–29, 2014, LNCS, Vol. 8633, Springer, 2014, pp. 1–12.

3. J. Case, S. Jain, S. Seah and F. Stephan, Automatic functions, linear time and learning, Logical Methods in Computer Science 9(3) (2013).

4. S.B. Cooper, Mathematics, metaphysics and the multiverse, in: Computation, Physics and Beyond – International Workshop on Theoretical Computer Science, WTCS 2012, Revised Selected and Invited Papers, Auckland, New Zealand, 21–24 February 2012, LNCS, Vol. 7160, Springer, 2012, pp. 252–267. Dedicated to Cristian S. Calude on the Occasion of His Sixtieth Birthday.

5. The machine as data: A computational view of emergence and definability;Cooper;Synthese,2015

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

1. CAYLEY LINEAR-TIME COMPUTABLE GROUPS;GROUPS COMPLEX CRYPT;2023

2. Lamplighter groups and automata;Acta Informatica;2022-06-08

3. Cayley polynomial–time computable groups;Information and Computation;2021-05

4. AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES;The Journal of Symbolic Logic;2019-04-29