CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
WELL-QUASI-ORDERING HEREDITARILY FINITE SETS
Alberto Policriti
,
A. Tomescu
2011-01-01
Cite
DOI
Type
Conference paper
Publication
5th International Conference on Language and Automata Theory and Applications, LATA2011
Related
Well-quasi-ordering hereditarily finite sets
Counting extensional acyclic digraphs
The Rational Construction of a Wheeler DFA
Cascade products and Wheeler automata
Incremental NFA minimization
Cite
×