Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference9 articles.
1. E. Post, Formal reductions of the general combinatorial decision problem,Amer. J. Math. 65 (1943), 197–215.
2. J. R. Büchi, Regular canonical systems,Arch. Math. Logik Grundlagenforsch. 6 (1964), 91–111.
3. M. Kratko, Formal'nye isčislenija Posta i konečnye avtomaty (Russian),Problemy Kibernet. 17 (1966), 41–65.
4. P. C. Rosenbloom,The Elements of Mathematical Logic, Dover, New York, 1950.
5. W. Hosken, Combinatorial systems which produce regular sets,Notices Amer. Math. Soc. 13 (1966), 732.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Work of J. Richard Büchi;Perspectives on the History of Mathematical Logic;2008
2. Computing by commuting;Theoretical Computer Science;2006-05
3. Complexity results for prefix grammars;RAIRO - Theoretical Informatics and Applications;2005-04
4. Deleting string rewriting systems preserve regularity;Theoretical Computer Science;2004-11
5. Extraction and Implication of Path Constraints;Lecture Notes in Computer Science;2004