116 search results - page 4 / 24 » Minimization of Automata |
FCT
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
WIA
2009
Springer
14 years 2 months 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...
FORMATS
2003
Springer
14 years 3 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...