Some problems in automata theory which depend on the models of set theory-Reference-Cited by-同舟云学术

Some problems in automata theory which depend on the models of set theory

Published:2011-10-03 Issue:4 Volume:45 Page:383-397
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Finkel Olivier

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/2011113/pdf

Reference26 articles.

1. Castro J. and Cucker F., Nondeterministicω-computations and the analytical hierarchy.J. Math. Logik Grundl. Math.35(1989) 333–342.

2. Cohen R.S. and Gold A.Y.,ω-computations on Turing machines.Theoret. Comput. Sci.6(1978) 1–23.

3. Finkel O., Borel ranks and Wadge degrees of omega context free languages.Math. Structures Comput. Sci.16(2006) 813–840.

4. Finkel O., On the accepting power of two-tape Büchi automata, inProceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science. STACS 2006.Lect. Notes Comput. Sci.3884(2006) 301–312.

5. Finkel O., The complexity of infinite computations in models of set theory.Log. Meth. Comput. Sci.5(2009) 1–19.

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

1. Hypercomputation of the Brain by Superluminal Particles;Rhythmic Advantages in Big Data and Machine Learning;2022

2. Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words;International Journal of Foundations of Computer Science;2019-04

3. Incompleteness Theorems, Large Cardinals, and Automata over Finite Words;Lecture Notes in Computer Science;2017

4. Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words;Automata, Languages, and Programming;2015