- Weitere Titel
-
Baumautomaten mit Constraints auf unendlichen Bäumen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Dissertation, 2021
- Schlagwort
-
Trees
Robots
Infinite
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2021
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2021-12010
- URN
-
urn:nbn:de:101:1-2022020302370490031911
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:35 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Landwehr, Patrick
- Löding, Christof
- Grädel, Erich
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2021
Ähnliche Objekte (12)
Tree Automata with Global Constraints for Infinite Trees
Weighted Tree Automata with Constraints
Paths in infinite trees : logics and automata
Paths in infinite trees : logics and automata
Complementation and Inclusion of Weighted Automata on Infinite Trees
Equational and membership constraints for infinite trees
Perfect hashing tree automata
Complementation and Inclusion of Weighted Automata on Infinite Trees : Revised Version
Efficient XML processing with tree automata
Weighted Unranked Tree Automata over Tree Valuation Monoids
Finite automata on unranked trees : extensions by arithmetical and equality constraints
Tree automata make ordinal theory easy
Tree Automata with Global Constraints for Infinite Trees
Weighted Tree Automata with Constraints
Paths in infinite trees : logics and automata
Paths in infinite trees : logics and automata
Complementation and Inclusion of Weighted Automata on Infinite Trees
Equational and membership constraints for infinite trees
Perfect hashing tree automata
Complementation and Inclusion of Weighted Automata on Infinite Trees : Revised Version
Efficient XML processing with tree automata
Weighted Unranked Tree Automata over Tree Valuation Monoids
Finite automata on unranked trees : extensions by arithmetical and equality constraints
Tree automata make ordinal theory easy
Tree Automata with Global Constraints for Infinite Trees
Weighted Tree Automata with Constraints
Paths in infinite trees : logics and automata
Paths in infinite trees : logics and automata
Complementation and Inclusion of Weighted Automata on Infinite Trees
Equational and membership constraints for infinite trees
Perfect hashing tree automata
Complementation and Inclusion of Weighted Automata on Infinite Trees : Revised Version
Efficient XML processing with tree automata
Weighted Unranked Tree Automata over Tree Valuation Monoids
Finite automata on unranked trees : extensions by arithmetical and equality constraints