X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    CAAP '81 : trees in algebra and programming ; 6th colloquium , Genova, March 5 - 7, 1981 ; proceedings (1981)
    Berlin (u.a.) : Springer
    Details
    UID:
    b3kat_BV036033428
    Format: 1 Online-Ressource (VI, 364 S.)
    ISBN: 3540108289
    Series Statement: Lecture notes in computer science 112
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Baum ; Konferenzschrift
    DOI: 10.1007/3-540-10828-9
    URL: Volltext
    Author information: Astesiano, Egidio 1939-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    EUV Frankfurt
    HTW Berlin
    TH Wildau
    BTU Cottbus
  • 2
    Online Resource
    Online Resource
    CAAP '81 : trees in algebra and programming, 6th colloquium, Genoa, March 5 - 7, 1981 ; proceedings (1981)
    Berlin [u.a.] : Springer
    Details
    UID:
    gbv_595132081
    Format: Online-Ressource (VI, 364 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540387169
    Series Statement: Lecture notes in computer science 112
    Content: Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and the nonlinearity -- Grammars without erasing rules. the OI case -- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes -- Certain algorithms for subgraph isomorphism problems -- A # P-complete problem over arithmetical trees -- Trees in Kripke models and in an intuitionistic refutation system -- Efficient optimization of monotonic functions on trees -- Differents types de derivations infinies dans les grammaires algebriques d'arbres -- Discriminability of infinite sets of terms in the D?-models of the ?-calculus.
    Note: Literaturangaben
    Additional Edition: ISBN 3540108289
    Additional Edition: ISBN 0387108289
    Additional Edition: ISBN 9783540108283
    Additional Edition: Erscheint auch als Druck-Ausgabe CAAP (6 : 1981 : Genua) CAAP '81 Berlin [u.a.] : Springer, 1981 ISBN 3540108289
    Additional Edition: ISBN 0387108289
    Language: English
    Keywords: Konferenzschrift
    DOI: 10.1007/3-540-10828-9
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: lizenzpflichtig
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
    UB Potsdam
  • 3
    Book
    Book
    CAAP '81 : trees in algebra and programming ; 6th colloquium , Genova, March 5 - 7, 1981 ; proceedings (1981)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almahu_BV002005278
    Format: VI, 364 S.
    ISBN: 3-540-10828-9 , 0-387-10828-9
    Series Statement: Lecture notes in computer science 112
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    RVK:
    ST 230
    Keywords: Baum ; Konferenzschrift ; Konferenzschrift
    Author information: Astesiano, Egidio 1939-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
    HU Berlin get availability status
  • 4
    Online Resource
    Online Resource
    CAAP '81 : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings (1981)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almafu_9959186246702883
    Format: 1 online resource (VI, 365 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38716-1
    Series Statement: Lecture Notes in Computer Science, 112
    Note: Bibliographic Level Mode of Issuance: Monograph , Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and the nonlinearity -- Grammars without erasing rules. the OI case -- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes -- Certain algorithms for subgraph isomorphism problems -- A # P-complete problem over arithmetical trees -- Trees in Kripke models and in an intuitionistic refutation system -- Efficient optimization of monotonic functions on trees -- Differents types de derivations infinies dans les grammaires algebriques d'arbres -- Discriminability of infinite sets of terms in the D?-models of the ?-calculus. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10828-9
    Language: English
    DOI: 10.1007/3-540-10828-9
    URL: http://dx.doi.org/10.1007/3-540-10828-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
    Charité
  • 5
    Book
    Book
    CAAP '81 : trees in algebra and programming ; 6th colloquium , Genova, March 5 - 7, 1981 ; proceedings (1981)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV002005278
    Format: VI, 364 S.
    ISBN: 3540108289 , 0387108289
    Series Statement: Lecture notes in computer science 112
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    RVK:
    ST 230
    Keywords: Baum ; Konferenzschrift
    Author information: Astesiano, Egidio 1939-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    TU Berlin get availability status
  • 6
    Online Resource
    Online Resource
    CAAP '81 : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings (1981)
    Berlin, Heidelberg : Springer Berlin Heidelberg
    Details
    UID:
    gbv_1649198671
    Format: Online-Ressource
    ISBN: 9783540387169
    Series Statement: Lecture Notes in Computer Science 112
    Additional Edition: ISBN 9783540108283
    Additional Edition: Buchausg. u.d.T. ISBN 978-3-540-10828-3
    Language: English
    DOI: 10.1007/3-540-10828-9
    URL: Volltext
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
  • 7
    Online Resource
    Online Resource
    CAAP '81 : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings (1981)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edocfu_9959186246702883
    Format: 1 online resource (VI, 365 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38716-1
    Series Statement: Lecture Notes in Computer Science, 112
    Note: Bibliographic Level Mode of Issuance: Monograph , Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and the nonlinearity -- Grammars without erasing rules. the OI case -- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes -- Certain algorithms for subgraph isomorphism problems -- A # P-complete problem over arithmetical trees -- Trees in Kripke models and in an intuitionistic refutation system -- Efficient optimization of monotonic functions on trees -- Differents types de derivations infinies dans les grammaires algebriques d'arbres -- Discriminability of infinite sets of terms in the D?-models of the ?-calculus. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10828-9
    Language: English
    DOI: 10.1007/3-540-10828-9
    URL: http://dx.doi.org/10.1007/3-540-10828-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
  • 8
    Online Resource
    Online Resource
    CAAP '81 : Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings (1981)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edoccha_9959186246702883
    Format: 1 online resource (VI, 365 p.)
    Edition: 1st ed. 1981.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-38716-1
    Series Statement: Lecture Notes in Computer Science, 112
    Note: Bibliographic Level Mode of Issuance: Monograph , Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and the nonlinearity -- Grammars without erasing rules. the OI case -- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes -- Certain algorithms for subgraph isomorphism problems -- A # P-complete problem over arithmetical trees -- Trees in Kripke models and in an intuitionistic refutation system -- Efficient optimization of monotonic functions on trees -- Differents types de derivations infinies dans les grammaires algebriques d'arbres -- Discriminability of infinite sets of terms in the D?-models of the ?-calculus. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-10828-9
    Language: English
    DOI: 10.1007/3-540-10828-9
    URL: http://dx.doi.org/10.1007/3-540-10828-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Charité
  • 9
    Book
    Book
    CAAP '81 : trees in algebra and programming ; 6th colloquium , Genova, March 5 - 7, 1981 ; proceedings (1981)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almafu_BV002005278
    Format: VI, 364 S.
    ISBN: 3-540-10828-9 , 0-387-10828-9
    Series Statement: Lecture notes in computer science 112
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    RVK:
    ST 230
    Keywords: Baum ; Konferenzschrift
    Author information: Astesiano, Egidio 1939-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    FU Berlin get availability status
  • 10
    Online Resource
    Online Resource
    CAAP '81 : Trees in Algebra and Programming 6th Colloquium Genoa, March 5–7, 1981 Proceedings (1981)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920871802882
    Format: VI, 365 p. , online resource.
    ISBN: 9783540387169
    Series Statement: Lecture Notes in Computer Science, 112
    Note: Algebraic theory of parameterized specifications with requirements -- A modal characterisation of observable machine-behaviour -- Trees as data and file structures -- Infinitary relations -- Full approximability of a class of problems over power sets -- How to compute generators for the intersection of subgroups in free groups -- Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG -- Top-down tree-transducers for infinite trees I -- Easy solutions are hard to find -- Une semantique pour les arbres non deterministes -- On the algebraic specification of nondeterministic programming languages -- Applied tree enumerations -- Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines) -- On pushdown tree automata -- Initial and terminal algebra semantics of parameterized abstract data type specifications with inequalities -- Calcul du rang des ?-arbres infinis regulers -- A class of tree-like UNION-FIND data structures and the nonlinearity -- Grammars without erasing rules. the OI case -- Proprietes de cloture d'une extension de transducteurs d'arbres deterministes -- Certain algorithms for subgraph isomorphism problems -- A # P-complete problem over arithmetical trees -- Trees in Kripke models and in an intuitionistic refutation system -- Efficient optimization of monotonic functions on trees -- Differents types de derivations infinies dans les grammaires algebriques d'arbres -- Discriminability of infinite sets of terms in the D?-models of the ?-calculus.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540108283
    Language: English
    DOI: 10.1007/3-540-10828-9
    URL: http://dx.doi.org/10.1007/3-540-10828-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages