D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084363451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Ehrenfeucht's conjecture / rank
 
Normal rank
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 presence of a zero in an integer linear recurrent sequence is NP-hard to decide / 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: Elementary homomorphisms and a solution of the DOL sequence equivalence problem / 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 simple proof of the Skolem-Mahler-Lech theorem / 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: A polynomial bound for certain cases of the D0L 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: An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the D0L sequence equivalence problem / 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: Q5622279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Marshall Hall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / 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: Q4265630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit test sets for iterated morphisms in free monoids and metabelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero multiplicity of linear recurrence sequences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:53, 28 June 2024

scientific article
Language Label Description Also known as
English
D0L sequence equivalence is in<i>P</i>for fixed alphabets
scientific article

    Statements

    D0L sequence equivalence is in<i>P</i>for fixed alphabets (English)
    0 references
    0 references
    0 references
    29 July 2008
    0 references
    0 references
    polynomial encoding of words
    0 references
    \(\mathbb Z\)-rational sequences
    0 references
    0 references