Classification of non-Leibnizian Strings
Furkan Semih Dündar
Abstract
Leibnizian ideas in foundations of physics has enjoyed a renewed interest. Cyclic string ontology in Wolfram Model multiway rewriting systems has been found to encode finite dimensional quantum systems where what are called as Leibnizian strings have been employed. It has then become important to classify strings in terms of their ability to correspond to a monadic interpretation à la Leibniz. The definition of Leibnizian strings are rather quite non-linear and for that purpose we classify non-Leibnizian strings for which there is a simpler criterion on maximal neighborhoods of characters. If a string is not non-Leibnizian then it must be Leibnizian. We found out three canonical forms of non-Leibnizian strings and noted that two of them are context-free languages whereas one is not.
Create a lesson
Related papers
Regular Separability for Bidirected VASS
Łukasz Orlikowski, Georg Zetzsche
The Scope Grammar of Natural-Language Rules: Counting and Enumerating Readings modulo Logical Equivalence
Sherzod Turaev, Mary John
On Small Universal Reversible Turing Machines
T. Yokoyama
General semiring conditions for weighted L* termination
Noah Bertram, Daniel Luckhardt, Alexandra Silva
Reachability in Five-Dimensional Vector Addition Systems Is PSPACE-Complete
Weijun Chen, Bo Fu, Yuxi Fu
Block-exchange descent for insertion: commuting projections and minimum masks
Haobo Ma, Wenlin Zhang, Charles E. Hughes