A robust class of linear recurrence sequences (Q2105454): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2968034306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of a family of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted automata and weighted logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Monadic Second-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Functions and Cost Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3545513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Positivity Problem for Simple Linear Recurrence Sequences, / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Restricted Variants of Skolem and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Automata of Bounded Ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak cost register automata are still powerful / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of ambiguity of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copyless cost-register automata: structure, expressiveness, and closure properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304149 / rank
 
Normal rank

Latest revision as of 01:55, 31 July 2024

scientific article
Language Label Description Also known as
English
A robust class of linear recurrence sequences
scientific article

    Statements

    A robust class of linear recurrence sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    linear recurrence sequences
    0 references
    weighted automata
    0 references
    cost-register automata
    0 references

    Identifiers