An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deux propriétés décidables des suites récurrentes linéaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ultimate equivalence problem for DOL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of the equivalence problem for DOL-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifications of homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every two equivalent DOL systems have a regular true envelope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bound for the DOL sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short solution for the HDT0L sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for binary DOL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank

Latest revision as of 12:50, 11 June 2024

scientific article
Language Label Description Also known as
English
An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
scientific article

    Statements

    An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (English)
    0 references
    0 references
    7 December 2005
    0 references
    D0L system
    0 references
    Equivalence problem
    0 references
    Ultimate equivalence problem
    0 references
    Decidability
    0 references

    Identifiers