Fundamentals of Computation Theory

Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981

AvF. Gecseg

Häftad, Engelska, 1981

Del i serien Lecture Notes in Computer Science

556 kr

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

Fler format och utgåvor

554 kr

1 022 kr

909 kr

842 kr

556 kr

538 kr

556 kr

571 kr

571 kr

571 kr

Produktinformation

Utgivningsdatum:1981-08-01
Mått:170 x 244 x 27 mm
Vikt:733 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:471
Upplaga:1981
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540108542

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik

Innehållsförteckning

Observability and Nerode equivalence in concrete categories.- Some universal algebraic and model theoretic results in computer science.- Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems.- Moderately exponential bound for graph isomorphism.- An algebraic definition of attributed transformations.- Analogies of PAL and COPY.- Quasi-equational logic for partial algeras.- Homogeneity and completeness.- On the error correcting power of pluralism in inductive inference.- Equality languages and language families.- Extremal combinatorial problems in relational data base.- Specifying algebraic data types by domain equations.- An axiomatization of regular forests in the language of algebraic theories with iteration.- Fast recognition of rings and lattices.- A definition of the P = NP-problem in categories.- Generating graph languages using hypergraph grammars.- Lower bounds for problems defined by polynomial inequalities.- What is computable for abstract data types ?.- On strongly cube-free ?-words generated by binary morphisms.- On the role of selectors in selective substitution grammars.- Classes of functions over binary trees.- Mathematical structures underlying greedy algorithms.- Some properties of language families generated by commutative languages.- Isomorphism completeness for some algebraic structures.- Reducing algebraic tree grammars.- Rational cone and substitution.- On the regularity problem of SF-languages generated by minimal linear grammars.- Co-algebras as machines for the interpretations of flow diagrams.- Random access machines and straight-line programs.- On the LBA problem.- Dynamic algebras of programs.- The equivalence problem for LL- and LR-regular grammars.- Context-free languages of infinitewords as least fixpoints.- Remarks on the notion of concurrency relation in the case of systems.- On the size of conjunctive representations of n-ary relations.- On subwords of formal languages.- First order dynamic logic with decidable proofs and workable model theory.- Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures.- Processes in Petri nets.- Some algebraic aspects of recognizability and rationality.- Pebbling and bandwidth.- On cellular graph-automata and second-order definable graph-properties.- Extensions of symmetric hom-functors to the Kleisli category.- A new operation between languages.- Logical description of computation processes.- An algorithm to identify slices, with applications to vector replacement systems.- One pebble does not suffice to search plane labyrinths.- About the by codings of environments induced posets [µ z, ?] and [?z, ?].- The complexity of automata and subtheories of monadic second order arithmetics.- Tape complexity of word problems.

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

554 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

932 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

571 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 022 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

932 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Del 12051

Sustainable Digital Communities

Anneli Sundqvist, Gerd Berget, Jan Nolin, Kjell Ivar Skjerdingstad

Häftad, 2020

1 071 kr

Types for Proofs and Programs

Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan Smith

Häftad, 2000

571 kr

Del 13216

Requirements Engineering: Foundation for Software Quality

Vincenzo Gervasi, Andreas Vogelsang

Häftad, 2022

627 kr

Component-Based Software Engineering

Heinz G. Schmidt, Ivica Crnkovic, George T. Heineman, Judith A. Stafford

Häftad, 2007

571 kr

Du kanske också är intresserad av

10% rabatt på allt

L'amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr