1 citations · 1 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.FL2019
On the Distance between Timed Automata
Amnon Rosenmann
The problem of inclusion of the language accepted by timed automaton (e.g., the implementation) in the language accepted by (e.g., the specification) is, in general, undeci…
math.CO2019
Circular automata synchronize with high probability
Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez +2
In this paper we prove that a uniformly distributed random circular automaton of order synchronizes with high probability (whp). More precisely, we prove that $…