Searching for "Corrigendum DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186." – sorted by Relevance.
-
Atomicity and Normalization
- Atomicity and Normalization Andy Carver and Terry Halpin Neumont University, Utah, USA. e
- Add To MetaCart
-
Atomicity in
- out flaws in atomicity. We pay special attention to the atomicity problems of proposals for digital
- Add To MetaCart
-
Normal forms for knowledge compilation
- . Even with a fixed atom ordering, this is not the case for DNNF. In this paper, several normal forms
- Cited by 8 (7 self) – Add To MetaCart
-
Decomposable negation normal form
- propositional theories in conjunctive normal form (CNF) into equivalent decomposable negation normal form (DNNF
- Cited by 63 (12 self) – Add To MetaCart
-
Normal Forms in Combinatory Logic
- it is the translate of a LC-term in long β-normal form (equivalently, the translate of a LC-term in βη-normal form
- Cited by 1 (1 self) – Add To MetaCart
-
Code Normal Forms
- . Approach: Code Normal Forms Very similar problems as the ones discussed in the context of maintainable code
- Add To MetaCart
-
Normal Forms For Connectedness In Categories
- simple result on the existence of normal forms for the following equivalence relation between objects
- Cited by 1 (0 self) – Add To MetaCart
-
Normal form results for
- conjunctive normal form. Then the repeated application of Proposition 2.9 produces a theory (D2, W
- Add To MetaCart
-
ATOMS
- .3. This result complements the result by Simon [14, Thm. C.2.5 (C14)] for the case of operators of the form (1
- Add To MetaCart
-
On Generating Small Clause Normal Forms
- -order TPTP problems, it shows that our clause normal form transformation yields fewer clauses and fewer
- Cited by 69 (2 self) – Add To MetaCart

