On the Complexity of Automatic Complexity-Reference-Cited by-同舟云学术

On the Complexity of Automatic Complexity

Published:2017-07-06 Issue:4 Volume:61 Page:1427-1439
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Kjos-Hanssen Bjørn^ORCID

Funder

Simons Foundation

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00224-017-9795-4/fulltext.html

Reference13 articles.

1. Allender, E.: The complexity of complexity. In: Computability and Complexity Symposium in honor of Rodney G. Downey’s 60th Birthday, volume 10010 of Lecture Notes in Computer Science, pp. 79–94. Springer (2017)

2. Angluin, D.: On the complexity of minimum inference of regular sets. Inform. Control 39(3), 337–350 (1978)

3. Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Z. Phonetik Sprachwiss Kommunikat. 14, 143–172 (1961)

4. Berstel, J.: Every iterated morphism yields a co-CFL. Inform. Process. Lett. 22(1), 7–9 (1986)

5. Cai, J.-Y., Gundermann, T., Hartmanis, J., Hemachandra, L.A., Sewelson, V., Wagner, K., Wechsung, G.: The Boolean hierarchy. I. Structural properties. SIAM J. Comput. 17(6), 1232–1252 (1988)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The number of languages with maximum state complexity;Algebra universalis;2022-07-30

2. An incompressibility theorem for automatic complexity;Forum of Mathematics, Sigma;2021

3. The Number of Languages with Maximum State Complexity;Lecture Notes in Computer Science;2019