Results 1  10
of
537,522
COMPUTATIONAL POWER OF ONEWAY MULTIHEAD FINITE AUTOMATA
"... In this paper we sketch our results concerning oneway multihead finite automata (1MFA). The full version with complete proofs can be found in a series of papers ([3],[4],[5],[6]). 1MFA belong to the weakest models of computational devices. Despite that, they recognize many interesting and importa ..."
Abstract
 Add to MetaCart
In this paper we sketch our results concerning oneway multihead finite automata (1MFA). The full version with complete proofs can be found in a series of papers ([3],[4],[5],[6]). 1MFA belong to the weakest models of computational devices. Despite that, they recognize many interesting
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various modelchecking techniques that were originally developed for finite
Interface Automata
 Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE), ACM
, 2001
"... Conventional type systems specify interfaces in terms of values and domains. ..."
Abstract

Cited by 455 (23 self)
 Add to MetaCart
Conventional type systems specify interfaces in terms of values and domains.
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
96 LETTER Special Section on Foundations of Computer Science PathBounded OneWay Multihead Finite Automata
, 2005
"... SUMMARY For each positive integer r ≥ 1, a nondeterministic machine M is r pathbounded if for any input word x, therearer computation paths of M on x. This paper investigates the accepting powers of pathbounded oneway (simple) multihead nondeterministic finite automata. It is shown that for each k ..."
Abstract
 Add to MetaCart
SUMMARY For each positive integer r ≥ 1, a nondeterministic machine M is r pathbounded if for any input word x, therearer computation paths of M on x. This paper investigates the accepting powers of pathbounded oneway (simple) multihead nondeterministic finite automata. It is shown that for each
A SIMULATION OF OBLIVIOUS MULTIHEAD ONEWAY FINITE AUTOMATA BY REALTIME CELLULAR AUTOMATA
"... ar ..."
Power of Cooperation and Multihead Finite Systems ⋆
"... Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other heads, but the automata cooperate in making state transitions. Computational power of such devices depends on the number of ..."
Abstract
 Add to MetaCart
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other heads, but the automata cooperate in making state transitions. Computational power of such devices depends on the number
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored. AMS subject classifications: 82P10, 11Y05, 68Q10. 1 Introduction One of the first results in the mathematics of computation, which underlies the subsequent development
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
, 1992
"... We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examp ..."
Abstract

Cited by 460 (20 self)
 Add to MetaCart
We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many
LowPower CMOS Digital Design
 JOURNAL OF SOLIDSTATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413
, 1992
"... Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use the ..."
Abstract

Cited by 570 (20 self)
 Add to MetaCart
Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use
Results 1  10
of
537,522