Affiliation:
1. Faculté des Sciences de Paris, Paris, France and The RAND Corporation, Santa Monica, California
Abstract
Two negative results concerning the so-called acceptable sets of numbers are extended to the case or arbitrary context-free languages with the help of conventional analytic techniques.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference10 articles.
1. Weak second order arithmetic and finite automata. Z. math;BHUCI J.R;Logik Grund. Math.,1961
2. On arithmetic properties of coefficients of rational functions;CANTOR D. G;Pacific J. Math.,1965
3. Sets definable by finite automata;COBHA A;IBM Res. Notes,1964
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献