Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition (Q1633055): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11704-014-3425-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072471271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-tensor product of matrices and its application to Morgen's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3224871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic dynamics of Boolean control networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i><sub>2</sub>stability,<i>H</i><sub>∞</sub>control of switched homogeneous nonlinear systems and their semi-tensor product of matrices representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllability and optimal control of a temporal Boolean network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output feedback stabilization control design for Boolean control networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving type-2 fuzzy relation equations via semi-tensor product of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular Boolean networks: Semi-tensor product approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of basic decision problems for tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for building combinational<i>P</i>automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input-state incidence matrix of Boolean control networks and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllers for reachability specifications for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete synchronization of temporal Boolean networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:07, 17 July 2024

scientific article
Language Label Description Also known as
English
Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
scientific article

    Statements

    Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2018
    0 references
    finite automata
    0 references
    reachability analysis
    0 references
    transition function expression
    0 references
    matrix approach
    0 references
    semi-tensor product
    0 references

    Identifiers