Compactness in the Theory of Continuous Automata

DOI10.1007/978-3-319-27683-0_18zbMath1474.68178OpenAlexW2293089103MaRDI QIDQ5283433

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 computationYoung measuresMyhill-Nerode theoremtopological monoidscontinuous automatacontinuous-time computation

Mathematics Subject Classification ID

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

Related Items (1)

A Survey on Analog Models of Computation

Cites Work

• Automata over continuous time
• Hybrid I/O automata.
• Topological automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compactness in the Theory of Continuous Automata