
General grammars that generate their sentences through derivation trees satisfying certain restrictions can be shown to generate k-linear or regular languages.


coremsg

demonstrating-metalinearness-and-regularity-of-languages-using-tree-restricted-general-grammars


Demonstrating Metalinearness and Regularity of Languages Using Tree-Restricted General Grammars


title_rewrite


The languages recognized by higher-dimensional automata are precisely the rational subsumption-closed sets of finite interval pomsets.


a-kleene-theorem-for-modeling-concurrent-systems-with-higher-dimensional-automata


A Kleene Theorem for Modeling Concurrent Systems with Higher-Dimensional Automata



Aﬃne string-to-string functions definable in the planar aﬃne λ-calculus λ℘ and first-order string transductions coincide.


characterization-of-first-order-string-transductions-via-planar-aﬃne-λ-calculus


Characterization of First-Order String Transductions via Planar Aﬃne λ-Calculus



The languages of higher-dimensional automata (HDAs) are precisely the subsumption closures of monadic second-order (MSO) definable sets of interval ipomsets of bounded width.


logical-characterization-of-higher-dimensional-automata-languages


Logical Characterization of Higher-Dimensional Automata Languages
