On a possible classification of real-time constructed sequences

DOI10.1016/0304-3975(89)90039-XMaRDI QIDQ1824399zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Production en temps réel et complexité de structure de suites infinies
• Iterative devices generating infinite words
• Morphisms on infinite alphabets, countable states automata and regular sequences
• Automatic sequences
• scientific article; zbMATH DE number 1759411

Cites work

• scientific article; zbMATH DE number 3824103 (Why is no real title available?)
• scientific article; zbMATH DE number 3911740 (Why is no real title available?)
• scientific article; zbMATH DE number 3926275 (Why is no real title available?)
• scientific article; zbMATH DE number 3986648 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• On the Computational Complexity of Algorithms
• Production en temps réel et complexité de structure de suites infinies
• Subword complexities of various classes of deterministic developmental languages without interactions
• Uniform tag sequences

Cited in

(1)

• Production en temps réel et complexité de structure de suites infinies

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

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