1728 search results - page 25 / 346 » The Size of Power Automata |
CSR
2006
Springer
14 years 5 days ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
ISPD
2000
ACM
14 years 26 days ago
2000
ACM
We propose a gate resizing method for delay and power optimization that is based on statistical static timing analysis. Our method focuses on the component of timing uncertainties...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
APN
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...