Language acceptability of finite automata based on theory of semi‐tensor product of matrices

DOI10.1002/asjc.2190zbMath1473.68104OpenAlexW2954731650MaRDI QIDQ5131102

Yongyi Yan, Jumei Yue, Zeng-Qiang Chen

Publication date: 2 November 2020

Published in: Asian Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/asjc.2190

zbMATH Keywords

finite automatasemi-tensor product of matriceslogical systemsmatrix approachfinite-valued systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Multilinear algebra, tensor calculus (15A69) Many-valued logic (03B50)

Cites Work

• Unnamed Item
• Unnamed Item
• A bialgebraic approach to automata and formal language theory
• Groups, graphs, languages, automata, games and second-order monadic logic
• Deterministic ordered restarting automata for picture languages
• A matrix-based approach to verifying stability and synthesizing optimal stabilizing controllers for finite-state automata
• Observability of Boolean networks via set controllability approach
• Algebraic formulation and Nash equilibrium of competitive diffusion games
• Automata, Boolean matrices, and ultimate periodicity.
• Model and control for a class of networked evolutionary games with finite memories and time-varying networks
• On labeled birooted tree languages: algebras, automata and logic
• Limited Automata and Context-Free Languages
• A Finite Convergence Criterion for the Discounted Optimal Control of Stochastic Logical Networks
• Identification of predictors of Boolean networks from observed attractor states
• Multiple Fuzzy Relation and Its Application to Coupled Fuzzy Control
• Solving type-2 fuzzy relation equations via semi-tensor product of matrices

This page was built for publication: Language acceptability of finite automata based on theory of semi‐tensor product of matrices