Author:
Shallit Jeffrey,Breitbart Yuri
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. J. L. Balcázar, J. Díaz, and J. Gabarró. Uniform characterizations of non-uniform complexity measures. Inform. and Control
67 (1985), 53–89.
2. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, Vol. 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
3. Y. Breitbart. On automaton and “zone” complexity of the predicate “to be a kth power of an integer”. Dokl. Akad. Nauk SSSR
196 (1971), 16–19. In Russian. English translation in Soviet Math. Dokl.
12 (1971), 10–14.
4. Y. Breitbart. Complexity of the calculation of predicates by finite automata. PhD thesis, Technion, Haifa, Israel, June 1973.
5. Y. Breitbart. Some bounds on the complexity of predicate recognition by finite automata. J. Comput. System Sci.
12 (1976), 336–349.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献