CAAP '81

Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings

AvE. Astesiano,C. Böhm

Häftad, Engelska, 1981

Del i serien Lecture Notes in Computer Science

557 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1981-06-01
Mått:155 x 233 x undefined mm
Vikt:458 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:365
Upplaga:1981
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540108283

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

λ-Calculus and Computer Science Theory

C. Böhm

Häftad, 1975

557 kr

Automata, Languages and Programming

G. Ausiello, C. Böhm

Häftad, 1978

557 kr

Signerad!

SIGNERAD - Om julens wälgång

Klara Peters Bastin

Inbunden, 2026

249 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

269 kr

-21%

Ha en nice dag

Mikael Yvesand

Inbunden, 2026

189 kr239 kr

-30%

Se dig inte om

Harlan Coben

Pocket, 2026

69 kr99 kr

-19%

Stortaxi

Flora Wiström

Inbunden, 2026

(3)

209 kr259 kr

Nyhet

Sluta aldrig skriv

Mats Olsson

Inbunden, 2026

239 kr

CAAP '81

Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 1981. Proceedings

AvE. Astesiano,C. Böhm

Häftad, Engelska, 1981

Del i serien Lecture Notes in Computer Science

557 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1981-06-01
Mått:155 x 233 x undefined mm
Vikt:458 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:365
Upplaga:1981
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540108283

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.