Sequences of Level 1, 2, 3,..., k,...

DOI10.1007/978-3-540-74510-5_6MaRDI QIDQ3499764zbMATH OpenOpenAlexFDO

Authors Géraud Sénizergues

Publication date 3 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74510-5_6

zbMATH Keywords

equivalence problemsiterated pushdown automatarecurrent sequences

Mathematics Subject Classification ID

Recurrences (11B37) Automata sequences (11B85) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Word-mappings of level 2
• Iterated pushdown automata and sequences of rational numbers
• Context-free sequences
• Enumeration and decidable properties of automatic sequences
• Enumeration and decidable properties of automatic sequences

Cited in

(8)

• Word-mappings of level 2
• Iterated pushdown automata and sequences of rational numbers
• Weak cost register automata are still powerful
• MC-finiteness of restricted set partition functions
• A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
• On polynomial recursive sequences
• On polynomial recursive sequences
• Comparison-free polyregular functions

This page was built for publication: Sequences of Level 1, 2, 3,..., k,...

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499764)