Quinn Tyler Jackson

  • Citations Per Year
Learn More
We introduce a fifth language accepting machine called the PDA-T, demonstrate some of its interesting formal properties, and show its role in the §-Calculus. Based upon this new machine and the §-Calculus’ other properties, we demonstrate the §-Calculus’ formal Turing Power, and then propose a formal language classification (the §-Hierarchy), derived(More)
Although in the realm of artificial language it is possible to construct languages that do not comprise expressions that are at once both ambiguous and semantically legal, some artificial languages, and all natural languages, present ambiguous constructs that are nonetheless semantically legal expressions accepted by the language. We introduce the(More)
  • 1