Sciweavers

6 search results - page 2 / 2
» Versions of Normality and Some Weak Forms of the Axiom of Ch...
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 10 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund