Results 141 to 150 of about 1,221 (189)
Free algebras for generalized automata and language theory (Algebraic Systems, Formal Languages and Computations)openaire
Matrix theory from the viewpoint of cellular automata (Algebra, Languages and Computation)
Matrix theory from the viewpoint of cellular automata (Algebra, Languages and Computation)openaire
Equational theories and the behavior of finite automata (Algebras, Languages, Algorithms and Computations)openaire
Some Remarks on Automata without Letichevsky Criteria (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)openaire
Cyclic system for an algebraic theory of alternating parity automata [PDF]
International Conference on Theorem Proving with Analytic Tableaux and Related Methods$\omega$-regular languages are a natural extension of the regular languages to the setting of infinite words. Likewise, they are recognised by a host of automata models, one of the most important being Alternating Parity Automata (APAs), a generalisation
Anupam Das, A. De
semanticscholar +4 more sources
Algebraic Language Theory with Effects [PDF]
International Colloquium on Automata, Languages and ProgrammingRegular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory.
Fabian Birkmann +3 more
semanticscholar +2 more sources
An algebraic theory of ω-regular languages, via μν-expressions [PDF]
arXiv.orgAlternating parity automata (APAs) provide a robust formalism for modelling infinite behaviours and play a central role in formal verification. Despite their widespread use, the algebraic theory underlying APAs has remained largely unexplored.
Anupam Das, A. De
semanticscholar +2 more sources
Automata-Theoretic Characterisations of Branching-Time Temporal Logics [PDF]
International Colloquium on Automata, Languages and ProgrammingCharacterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods.
M. Benerecetti +3 more
semanticscholar +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Language acceptability of finite automata based on theory of semi‐tensor product of matrices
Asian journal of control, 2019Using the theories of many‐valued logic and semi‐tensor product of matrices (STP), this paper investigates how to mathematically determine whether or not a regular language is recognized by finite automata (FA).
Jumei Yue, Yongyi Yan, Zengqiang Chen
semanticscholar +1 more source