On a possible classification of real-time constructed sequences

DOI10.1016/0304-3975(89)90039-XzbMATH Open0682.68067OpenAlexW1996632568MaRDI QIDQ1824399FDOQ1824399

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

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

zbMATH Keywords

transduceriterative productionreal-time sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the Computational Complexity of Algorithms
• Title not available (Why is that?)
• Uniform tag sequences
• Subword complexities of various classes of deterministic developmental languages without interactions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Production en temps réel et complexité de structure de suites infinies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)