From finite automata toward hybrid systems (Extended abstract)

DOI10.1007/BFb0036202OpenAlexW1922229810MaRDI QIDQ5055953

Alexander Rabinovich, B. A. Trakhtenbrot

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0036202

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Computability of analog networks ⋮ Automata and logics over finitely varying functions ⋮ From Logic to Theoretical Computer Science – An Update ⋮ A Survey on Analog Models of Computation ⋮ Finite variability interpretation of monadic logic of order

Cites Work

• A theory of timed automata
• Introduction to the theory of finite automata. Translated from the Russian. Translation edited by J.C. Shepherdson
• Some definitional suggestions for automata theory
• On the synthesis of discrete controllers for timed systems
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item

This page was built for publication: From finite automata toward hybrid systems (Extended abstract)