Kirjaudu sisään
näkemys - Formal languages and automata theory
具有長度限制的 E-模式語言的等價性問題是不可判定的
允許長度限制的 E-模式語言（允許變數替換為空字元的模式語言）的等價性問題是不可判定的，即使在僅考慮變數相等的情況下也是如此。
Demonstrating Metalinearness and Regularity of Languages Using Tree-Restricted General Grammars
General grammars that generate their sentences through derivation trees satisfying certain restrictions can be shown to generate k-linear or regular languages.
A Kleene Theorem for Modeling Concurrent Systems with Higher-Dimensional Automata
The languages recognized by higher-dimensional automata are precisely the rational subsumption-closed sets of finite interval pomsets.
Characterization of First-Order String Transductions via Planar Affine λ-Calculus
Affine string-to-string functions definable in the planar affine λ-calculus λ℘ and first-order string transductions coincide.
Logical Characterization of Higher-Dimensional Automata Languages
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.
Tuotteet
© 2024 by Linnk AI