Syntactic complexity of regular ideals (Q722210): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5306170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2819381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient complexity of ideal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient complexity of closed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5178449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for convex languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Aperiodic Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bound on Syntactic Complexity of Suffix-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of átomata / 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: Q4474150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of basic operations on suffix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deterministic finite automata and syntactic monoid size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimate-Definite and Symmetric-Definite Events and Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les bases du groupe symétrique et du groupe alternant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic complexity of bifix-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank

Revision as of 04:09, 16 July 2024

scientific article
Language Label Description Also known as
English
Syntactic complexity of regular ideals
scientific article

    Statements

    Syntactic complexity of regular ideals (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2018
    0 references
    factor-closed
    0 references
    left ideal
    0 references
    prefix-closed
    0 references
    regular language
    0 references
    right ideal
    0 references
    suffix-closed
    0 references
    syntactic complexity
    0 references
    transition semigroup
    0 references
    two-sided ideal
    0 references
    upper bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references