Compactness in the Theory of Continuous Automata

DOI10.1007/978-3-319-27683-0_18zbMATH Open1474.68178OpenAlexW2293089103MaRDI QIDQ5283433FDOQ5283433

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

Young measuresanalog computationMyhill-Nerode theoremtopological monoidscontinuous automatacontinuous-time computation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hybrid I/O automata.
• Automata over continuous time
• Topological automata

Cited In (4)

• Title not available (Why is that?)
• A Survey on Analog Models of Computation
• Title not available (Why is that?)
• Automata over continuous time

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)