Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Automaton-Definable Tree Relations with Cardinality Constraints
 

Summary: Automaton-Definable Tree Relations with Cardinality
Constraints
Diploma Thesis
Nils Jansen
Chair of Computer Science 7
RWTH Aachen
May 28, 2010
Nils Jansen - Automaton-Definable Tree Relations with Cardinality Constraints 1 / 36
Contents
1 Preliminaries
2 Rational Tree Relations
3 Rational Relations over Unranked Trees
4 Tree Relations with Cardinality Constraints
5 Conclusion
Nils Jansen - Automaton-Definable Tree Relations with Cardinality Constraints 2 / 36
Contents
1 Preliminaries
2 Rational Tree Relations
3 Rational Relations over Unranked Trees
4 Tree Relations with Cardinality Constraints

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences