State Complexity of Projected Languages (Q5200092): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Introduction to Discrete Event Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of natural observers in discrete-event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Verification in Supervisory Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic numbers in the state hierarchy of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of NFAs which need 2\(^{n}-\alpha\) deterministic states / rank
 
Normal rank
Property / cites work
 
Property / cites work: DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Complements, Stars, and Reversals of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Numbers and Ternary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory control synthesis of discrete-event systems using a coordination scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Control of Discrete-Event Systems With Coalgebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5554980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727828 / rank
 
Normal rank

Latest revision as of 09:10, 4 July 2024

scientific article; zbMATH DE number 5934416
Language Label Description Also known as
English
State Complexity of Projected Languages
scientific article; zbMATH DE number 5934416

    Statements

    State Complexity of Projected Languages (English)
    0 references
    0 references
    0 references
    29 July 2011
    0 references
    0 references
    0 references