Sciweavers

15 search results - page 2 / 3
» Monotone AC-Tree Automata
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 9 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
CADE
2008
Springer
14 years 5 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
DAC
2003
ACM
14 years 6 months ago
Quantum-dot cellular automata: computing by field polarization
As CMOS technology continues its monotonic shrink, computing with quantum dots remains a goal in nanotechnology research. Quantum-dot cellular automata (QCA) is a paradigm for low...
Gary H. Bernstein
COLT
1999
Springer
13 years 9 months ago
On Theory Revision with Queries
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
Robert H. Sloan, György Turán
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 2 months ago
Probabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Ana Busic, Jean Mairesse, Irene Marcovici