Some Context-free Languages and Their Associated Dynamical Systems Public Deposited

Downloadable Content

Download PDF
Last Modified
  • February 26, 2019
Creator
  • James, Landon
    • Affiliation: College of Arts and Sciences, Department of Mathematics
Abstract
  • This paper focuses on certain context-free dynamical systems within the framework of symbolic dynamics and formal language theory. Our main results include using a block counting method to calculate the entropy of the Dyck languages, applying the Chomsky-Schutzenberger theorem to the Łukasiewicz language, discovering the structure of winning strategies for a combinatorial game involving the Dyck languages, and showing how to construct positive entropy minimal subshifts whose winning strategies are worth studying. These main results are supplemented with an overview of some features of formal languages and symbolic dynamics.
Date of publication
Keyword
DOI
Resource type
Rights statement
  • In Copyright
Note
  • Funding: None
Advisor
  • Petersen, Karl Endel
Degree
  • Bachelor of Science
Honors level
  • Honors
Degree granting institution
  • University of North Carolina at Chapel Hill
Extent
  • 26
Parents:

This work has no parents.

Items