Advanced search
Publication Cover
Experimental Mathematics Volume 28, 2019 - Issue 1
Submit an article Journal homepage
77
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Few Paths, Fewer Words: Model Selection With Automatic Structure Functions

Bjørn Kjos-HanssenUniversity of Hawaii at Manoa, Honolulu, HI, USACorrespondence[email protected]
ORCID Iconhttp://orcid.org/0000-0002-6199-1755
ORCID Icon
Pages 121-127 | Published online: 04 Oct 2017

References

  • [Chambers 14] P. Chambers. “Automatic Complexity of Doubletons.” Verbal Presentation as a Final Exam for MATH 657, University of Hawaii at Mānoa, Spring, 2014.
  • [Hyde and Kjos-Hanssen 15] K. Hyde and B. Kjos-Hanssen. “Nondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words.” Electron. J. Combin. 22:3:Paper 3.22 (2015), 18.
  • [Kjos-Hanssen 17] B. Kjos-Hanssen. “Shift Registers Fool Finite Automata.” Lecture Notes in Computer Science, 10388 (2017), 170–181. Paper presented at the 24th International Workshop on Logic, Language, Information, and Computation, London, UK, 2017.
  • [Kjos-Hanssen 15] B. Kjos-Hanssen. “Kolmogorov Structure Functions for Automatic Complexity.” Theoret. Comput. Sci. 607: part 3 (2015), 435–445.
  • [Kjos-Hanssen 17] B. Kjos-Hanssen. “Code Repository for “Few Paths, Fewer Words: Model Selection with Automatic Structure Functions”.” Available online https://bitbucket.org/bjoernkjoshanssen/automatic-complexity, March 2017.
  • [Rissanen 07] J. Rissanen. Information and Complexity in Statistical Modeling. Information Science and Statistics. New York: Springer, 2007.
  • [Shallit and Wang 01] J. Shallit and M.-W. Wang. “Automatic Complexity of Strings.” J. Autom. Lang. Comb. 6:4 (2001), 537–554. Paper presented at 2nd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, London, ON, 2000.
  • [Staiger 07] L. Staiger. “The Kolmogorov Complexity of Infinite Words.” Theoret. Comput. Sci. 383: 2–3 (2007), 187–199.
  • [Vereshchagin and Vitányi 04] N. K. Vereshchagin and P. M. B. Vitányi. “Kolmogorov’s Structure Functions and Model Selection.” IEEE Trans. Inform. Theory 50: 12 (2004), 3265–3290.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.