Nondeterministic State Complexity of Star-Free Languages (Q5200063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of finite automata accepting subregular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of Star Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2819381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decompositions of Regular Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient complexity of closed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages / 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: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of some operations on binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity in Union-Free Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / 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: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power-separating regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank

Latest revision as of 08:10, 4 July 2024

scientific article; zbMATH DE number 5934390
Language Label Description Also known as
English
Nondeterministic State Complexity of Star-Free Languages
scientific article; zbMATH DE number 5934390

    Statements

    Nondeterministic State Complexity of Star-Free Languages (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers