Related papers: Formal languages, spin systems, and quasicrystals
A simple tight-binding theoretical model is proposed for spin dependent, current-in-plane transport in highly coherent spin valve structures under specularity conditions. Using quantum-mechanically coherent and spatially quantized Fermi…
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…
Multicomponent commutations relations (MCR) describe plektons, i.e., multicomponent quantum systems with a generalized statistics. In such systems, exchange of quasiparticles is governed by a unitary matrix $Q(x_1,x_2)$ that depends on the…
In this work we apply the Fradkin-Vasiliev formalism based on the frame-like gauge invariant description of the massive and massless spin 2 to the construction of the cubic interactions vertices for massive spin 2 self-interaction as well…
Generating functions encoding cubic interactions of (partially-)massless higher-spin fields are provided within the ambient-space formalism. They satisfy a system of higher-order partial differential equations that can be explicitly solved…
We introduce a new category of non-archimedean analytic spaces over a complete discretely valued field. These spaces, which we call uniformly rigid, may be viewed as classical rigid-analytic spaces together with an additional uniform…
There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…
Motzkin spin-chains, which include 'colorless' (integer spin $s=1$) and 'colorful' ($s \geq 2$) variants, are one-dimensional (1D) local integer spin models notable for their lack of a conformal field theory (CFT) description of their…
Recent interest in point and line node semimetals has led to the proposal and discovery of these phenomena in numerous systems. Frequently, though, these nodal systems are described in terms of individual properties reliant on specific…
Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…
F-systems are digraphs that enable to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and Yablo's can be analyzed with that tool to find graph-theoretic patterns. In this paper we present the F-systems…
Large Language Models (LLMs) have been shown to achieve breakthrough performance on complex logical reasoning tasks. Nevertheless, most existing research focuses on employing formal language to guide LLMs to derive reliable reasoning paths,…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…
The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…
We set up a formalism of Maurer-Cartan moduli sets for L-infinity algebras and associated twistings based on the closed model category structure on formal differential graded algebras (a.k.a. differential graded coalgebras). Among other…
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…
Frustrated spin systems can show phases with spontaneous breaking of spin-rotational symmetry without the formation of local magnetic order. We study the dynamic response of the spin-nematic phase of one-dimensional spin-1/2 systems,…
Enterprise modeling deals with the increasing complexity of processes and systems by operationalizing model content and by linking complementary models and languages, thus amplifying the model-value beyond mere comprehensible pictures. To…
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…