Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference36 articles.
1. J.-M. Autebert, J. Berstel, and L. Boasson. Context free languages and pushdown automata. InHandbook of formal languages, Vol. 1. Springer-Verlag, 1996.
2. J.-H. Altenbernd, W. Thomas, and S. Wöhrle. Tiling systems over infinite pictures and their acceptance conditions. InProceedings of the 6th International Conference Developments in Language Theory, DLT 2002, volume 2450 ofLecture Notes in Computer Science, pages 297-306. Springer, 2003.
3. A. Ballier and E. Jeandel. Tilings and model theory. InProceedings of the Journ´ees Automates Cellulaires 2008, Uzes, France, pages 29-39, 2008.
4. J.R. Büchi. On a decision method in restricted second order arithmetic. In Stanford University Press, editor,Proceedings of the 1960 International Congress on Logic Methodology and Philosophy of Science, pages 1-11. Stanford University Press, 1962.
5. ω-Computations on Turing machines
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献