default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTree Automata and Languages 1992
- Maurice Nivat, Andreas Podelski:
Tree Automata and Languages. North-Holland 1992 - Maurice Nivat:
Binary tree codes. Tree Automata and Languages 1992: 1-20 - Philippe Aigrain, Maurice Nivat:
Suffix, prefix and maximal tree codes. Tree Automata and Languages 1992: 21-40 - Andreas Podelski:
A monoid approach to tree automata. Tree Automata and Languages 1992: 41-56 - Magnus Steinby:
A theory of tree language varieties. Tree Automata and Languages 1992: 57-82 - Detlef Seese:
Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees. Tree Automata and Languages 1992: 83-114 - Igor Litovsky, Yves Métivier:
Computing trees with graph rewriting systems with priorities. Tree Automata and Languages 1992: 115-140 - Bruno Courcelle:
Recognizable sets of unrooted trees. Tree Automata and Languages 1992: 141-158 - André Arnold, Damian Niwinski:
Fixed point characterization of weak monadic logic definable sets of trees. Tree Automata and Languages 1992: 159-188 - Ahmed Saoudi, Paola Bonizzoni:
Automata on infinite trees and rational control. Tree Automata and Languages 1992: 189-200 - Paola Bonizzoni, Giancarlo Mauri, Giovanni Pighizzini, Nicoletta Sabadini:
Recognizing sets of labelled acyclic graphs. Tree Automata and Languages 1992: 201-224 - Ahmed Saoudi:
Rational and recognizable infinite tree sets. Tree Automata and Languages 1992: 225-234 - Martin Große-Rhode, Christian Dimitrovici:
Algebraic specification of action trees and recursive processes. Tree Automata and Languages 1992: 235-290 - Irène Guessarian:
Trees and algebraic semantics. Tree Automata and Languages 1992: 291-310 - Jean-Claude Raoult:
A survey of tree transductions. Tree Automata and Languages 1992: 311-326 - Max Dauchet, Sophie Tison:
Structural complexity of classes of tree languages. Tree Automata and Languages 1992: 327-354 - Helmut Seidl:
Ambiguity and valuedness. Tree Automata and Languages 1992: 355-380 - Zoltán Fülöp, Sándor Vágvölgyi:
Decidability of the inclusion in monoids generated by tree transformation classes. Tree Automata and Languages 1992: 381-408 - Aravind K. Joshi, Yves Schabes:
Tree-adjoining grammars and lexicalized grammars. Tree Automata and Languages 1992: 409-432 - I. Simon:
A short proof of the factorization forest theorem. Tree Automata and Languages 1992: 433-438 - Jean H. Gallier:
Unification procedures in automated deduction methods based on matings: A survey. Tree Automata and Languages 1992: 439-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-01 20:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
