423 search results - page 42 / 85 » The Generalization of Generalized Automata: Expression Autom... |
UC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
JUCS
2002
13 years 8 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
RTA
2005
Springer
14 years 2 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
DAC
2003
ACM
14 years 9 months ago
2003
ACM
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present...