@inproceedings{1e8ee8d404be4d41b9e3488f79f72d91,
title = "From finite automata toward hybrid systems",
abstract = "We consider two orthogonal extensions of the basic finite automaton paradigm and clarify to what degree and in what form do they preserve fundamental facts from the theory of finite automata. Hopefully, this approach facilitates a lucid adaptation of Automata Theory to Hybrid Systems.",
author = "A. Rabinovich and Trakhtenbrot, {B. A.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 11th International Symposium on Fundamentals of Computation Theory, FCT 1997 ; Conference date: 01-09-1997 Through 03-09-1997",
year = "1997",
doi = "10.1007/BFb0036202",
language = "אנגלית",
isbn = "3540633863",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "411--422",
editor = "Chlebus, {Bogdan S.} and Ludwik Czaja",
booktitle = "Fundamentals of Computation Theory - 11th International Symposium, FCT 1997, Proceedings",
}