Extremal minimality conditions on automata (Q441884): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.tcs.2012.03.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061771611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowly Synchronizing Automata and Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronised automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic Complexity of Ideal and Closed Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-entry finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the disjunctive set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Never Minimal Automata and the Rainbow Bipartite Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata with Extremal Minimality Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on Automata Minimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph theoretic approach to automata minimality / rank
 
Normal rank

Latest revision as of 13:34, 5 July 2024

scientific article
Language Label Description Also known as
English
Extremal minimality conditions on automata
scientific article

    Statements

    Extremal minimality conditions on automata (English)
    0 references
    0 references
    0 references
    8 August 2012
    0 references
    0 references
    minimality problem
    0 references
    state-pair graph
    0 references
    minimal automata
    0 references
    deterministic finite automata
    0 references
    0 references