Results 101 to 110 of about 63,385 (219)
Decision procedures for families of deterministic pushdown automata [PDF]
The existence and complexity of decision procedures for families of deterministic pushdown automata are investigated, with special emphasis on positive decidability results for those questions, such as equivalence, which are known to become ...
Valiant, Leslie
core
Incremental evolution of cellular automata for random number generation
, 2003 Cellular automata (CA) have been used in pseudorandom number generation for over a decade. Recent studies show that controllable CA (CCA) can generate better random sequences than conventional one-dimensional (1-d) CA and compete with two-dimensional (2 ...
Zhang, S. +3 more
core +1 more source
SpectralConway: Cellular Automata Off The Grid
, 2010 SpectralConway is a spectral implementation of cellular automata (CA), specifically John Conway's Game of Life (GoL). The process eschews the traditional quantised grid paradigm of the CA in favour of a frequency continuum.
Tremblay, Pierre Alexandre +2 more
core
On weighted time optimal control for linear hybrid automata using quantifier elimination
, 2004 This paper considers the optimal control problem for linear hybrid automata. In particular, it is shown that the problem can be transformed into a constrained optimization problem whose constraints are a set of inequalities with quantifiers.
Spathopoulos, M.P. +5 more
core +1 more source
Annals of Pure and Applied LogicWe introduce presheaf automata as a generalisation of different variants of higher-dimensional automata and other automata-like formalisms, including Petri nets and vector addition systems. We develop the foundations of a language theory for them based on notions of paths and track objects.
Georg Struth, Krzysztof Ziemiański
openaire +2 more sources
, 1999 Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see[CK96] for a survey). In model checking, a high level description of a system is compared against a logical correctness requirement to discover inconsistencies.
openaire +2 more sources
Theoretical Computer Science, 1987 The author defines Cayley automata. These are finite state devices, acting as acceptors, capable of ``walking'' on an input Cayley graph (of some group) and eventually deciding whether to accept or reject the graph. Such an automaton is equipped with a finite number of pebbles (markers) which it can rop on (and pick from) the nodes of the graph.
openaire +1 more source
Enumeration of r-smooth words over a finite alphabet [PDF]
Discrete Mathematics Letters, 2023 Toufik Mansour +2 more
doaj +1 more source
Conflict-preserving abstraction of discrete event systems using annotated automata
, 2012 This paper proposes to enhance compositional verification of the nonblocking property of discrete event systems by introducing annotated automata. Annotations store nondeterministic branching information, which would otherwise be stored in extra states ...
Malik, Robi, Ware, Simon
core +1 more source
, 2003 Cellular Automata (CA) has been used in pseudorandom number generation over a decade. Recent studies show that two-dimensional (2-d) CA Pseudorandom Number Generators (PRNGs) may generate better random sequences than conventional one-dimensional (1-d) CA
Guan, SU, Zhang, S
core