CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
Decidability results for classes of purely universal formulae and quantifiers elimination in Set Theory
D Cantone
,
V Cutello
,
Alberto Policriti
1988-01-01
Cite
Type
Journal article
Publication
LE MATEMATICHE
Related
The Automation of Syllogistic II. Optimization and Complexity Issues
THE QUEST FOR DIOPHANTINE FINITE-FOLD-NESS
The Rational Construction of a Wheeler DFA
Cascade products and Wheeler automata
Incremental NFA minimization
Cite
×