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

DOI10.1007/978-3-540-74510-5_6zbMath1188.68219OpenAlexW1602065277MaRDI QIDQ3499764

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

recurrent sequencesiterated pushdown automataequivalence problems

Mathematics Subject Classification ID

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

Related Items

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings, Word-mappings of level 2, Unnamed Item, Weak Cost Register Automata are Still Powerful