On a possible classification of real-time constructed sequences

DOI10.1016/0304-3975(89)90039-XzbMath0682.68067OpenAlexW1996632568MaRDI QIDQ1824399

Noelle Bleuzen-Guernalec

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90039-x

zbMATH Keywords

transduceriterative productionreal-time sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Subword complexities of various classes of deterministic developmental languages without interactions
• Production en temps réel et complexité de structure de suites infinies
• On the Computational Complexity of Algorithms
• Uniform tag sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a possible classification of real-time constructed sequences