Compactness in the theory of continuous automata

DOI10.1007/978-3-319-27683-0_18MaRDI QIDQ5283433zbMATH OpenOpenAlexFDO

Authors Scott Messick

Publication date 21 July 2017

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27683-0_18

zbMATH Keywords

analog computationcontinuous automatacontinuous-time computationMyhill-Nerode theoremtopological monoidsYoung measures

Mathematics Subject Classification ID

Compactness (54D30) Formal languages and automata (68Q45)

Recommendations

• Automata over continuous time
• scientific article; zbMATH DE number 1507210
• A topology for automata. II
• scientific article; zbMATH DE number 2112986
• STACS 2005

Cites work

• A survey on continuous time computations
• Automata over continuous time
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1507210 (Why is no real title available?)
• scientific article; zbMATH DE number 2152346 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• Hybrid I/O automata.
• Topological automata

Cited in

(6)

• A topology for automata. II
• Automata over continuous time
• scientific article; zbMATH DE number 1754581 (Why is no real title available?)
• scientific article; zbMATH DE number 2112986 (Why is no real title available?)
• One-way topological automata and the tantalizing effects of their topological features
• A Survey on Analog Models of Computation

This page was built for publication: Compactness in the theory of continuous automata

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