Author:
Pierron Théo,Place Thomas,Zeitoun Marc
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Lecture Notes in Computer Science;M Arfi,1987
2. Lecture Notes in Computer Science;M Bojańczyk,2008
3. Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci. 16(1), 37–55 (1978)
4. Büchi, J.R.: Weak second-order arithmetic and finite automata. Math. Logic Q. 6(1–6), 66–92 (1960)
5. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr.), pp. 1–11. Stanford Univ. Press, Stanford (1962)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adding Successor;ACM Transactions on Computational Logic;2020-03-18