2465 search results - page 12 / 493 » Automata on Linear Orderings |
WIA
2009
Springer
14 years 6 days ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
MLQ
2007
13 years 7 months ago
2007
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
ANOR
2008
13 years 7 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
HYBRID
2005
Springer
14 years 1 months ago
2005
Springer
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes assoc...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer