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

DOI10.1002/ASJC.2190MaRDI QIDQ5131102zbMATH OpenOpenAlexFDO

Authors Jumei Yue, Y. Y. Yan, Zengqiang 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) Multilinear algebra, tensor calculus (15A69) Many-valued logic (03B50) Algebraic theory of languages and automata (68Q70)

Recommendations

• Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
• Controllability, reachability, and stabilizability of finite automata: a controllability matrix method
• scientific article; zbMATH DE number 3915631
• Languages recognized by a class of finite automata
• Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• A Finite Convergence Criterion for the Discounted Optimal Control of Stochastic Logical Networks
• A bialgebraic approach to automata and formal language theory
• A matrix-based approach to verifying stability and synthesizing optimal stabilizing controllers for finite-state automata
• Algebraic formulation and Nash equilibrium of competitive diffusion games
• An introduction to semi-tensor product of matrices and its applications
• Automata, Boolean matrices, and ultimate periodicity.
• Deterministic ordered restarting automata for picture languages
• Groups, graphs, languages, automata, games and second-order monadic logic
• Identification of predictors of Boolean networks from observed attractor states
• Limited automata and context-free languages
• Model and control for a class of networked evolutionary games with finite memories and time-varying networks
• Multiple fuzzy relation and its application to coupled fuzzy control
• Observability of Boolean networks via set controllability approach
• On labeled birooted tree languages: algebras, automata and logic
• Solving type-2 fuzzy relation equations via semi-tensor product of matrices

Cited in

(6)

• Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
• ACCEPTABLE STRINGS IN AN AUTOMATON
• Matrix approach to I-detectability of partially observed discrete event systems
• A new look at the critical observability of finite state machines from an algebraic viewpoint
• Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
• scientific article; zbMATH DE number 1088283 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131102)