Fundamentals of Computation Theory

Proceedings of the 1977 International FCT-Conference. Poznan - Kornik, Poland, September 19 - 23, 1977

Häftad, Engelska, 1977

AvMarek Karpinski

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1977-09-01
Mått155 x 235 x 30 mm
Vikt838 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor546
Upplaga1977
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540084426

Tillhör följande kategorier

Methodology of proving a finite-state stochastic representability and nonrepresentability.- Non deterministic recursive program schemes.- Some remarks on relational composition in computational theory and practice.- An axiomatization of the rational data objects.- Some recent results on recognizable formal power series.- Canonical forms of context-free grammars and position restricted grammar forms.- Environments, labyrinths and automata.- Automata in labyrinths.- Stochastic algebras and stochastic automata over general measurable spaces: Algebraic theory and a decomposition theorem.- Some remarks on the algebra of automaton mappings.- Algebraic semantics of type definitions and structured variables.- Universal algebras and tree automata.- Vectors of coroutines over blikle nets.- Initial algebraic semantics for non context-free languages.- Reading functions and an extension of Kleene theorem for some families of languages.- Operations on ?-regular languages.- On the relation between graph grammars and graph L-systems.- On the theory of syntactic monoids for rational languages.- The equivalence of schemata with some feedbacks.- Disjunctive languages and codes.- Families of R-fuzzy Languages.- Algebras of partial sequences — A tool to deal with concurrency.- Remarks on fixed points of functors.- Recognizable and regular languages in a category.- Free dynamics and algebraic semantics.- Efficient state-splitting.- Nets over many sorted operator domains and their semantics.- Embedding theorems in the algebraic theory of graph grammars.- Some "geometrical" categories associated with flowchart schemes.- On partial recursive definitions and programs.- Transformations of derivation sequences in graph grammars.- Applicability of a production in a categorical grammar.- Onorder-complete universal algebra and enriched functorial semantics.- Functorial semantics of the type free ?-?? calculus.- A more categorical model of universal algebra.- Graph grammars.- Fixed-points and algebras with infinitely long expressions, II.- Relational automata in a category and their languages.- Generalized linton algebras.- On analysis of protoschemes.- Using determinancy of games to eliminate quantifiers.- Non-generable RE sets.- Polynomial time algorithms in the theory of linear diophantine equations.- Complexity of common subsequence problems.- Complexity of sequence encodings.- Network complexity.- On computability of Kolmogorov complexity.- The equivalences problems for binary EOL-Systems are decidable.- On a theory of inductive inference.- On finite and infinite computations.- Expected behavior of graph coloring algorithms.- Two NP-complete problems related to information retrieval.- On properties of certain synchronizing tool for parallel computations.- The parallel complexity of arithmetic computation.- Maximal rectangular relations.- A Dushnik - Miller type dimension of graphs and its complexity.- Programmability and P=NP conjecture.- An algorithmic approach to set theory.- Decidability of ? — Trees with bounded sets — A survey.- Empty - storage - acceptance of ? - languages.- Degrees of circuit complexity.- Recursive ?-languages.- A generalized computability thesis.

Du kanske också är intresserad av

Fast Parallel Algorithms for Graph Matching Problems

Del 9

Fast Parallel Algorithms for Graph Matching Problems

Marek Karpinski, Wojciech Rytter, Germany) Karpinski, Marek (Chair Professor of Computer Science, Chair Professor of Computer Science, University of Bonn, and University of Liverpool) Rytter, Wojciech (Professor of Computer Science, Professor of Computer Science, University of Warsaw, Poland

2 369 kr

Liken vi begravde

Bokrea

Liken vi begravde

119 kr329 kr

Lucia är död

Bokrea

Del 3

Lucia är död

Katarina Wennstam

99 kr289 kr

Klanen

Bokrea

Del 1

Klanen

99 kr299 kr

Kråkan säger AKTA!

Bokrea

Kråkan säger AKTA!

Jujja Wieslander, Sven Nordqvist

69 kr139 kr

Mina vänner

Bokrea

Mina vänner

Fredrik Backman

119 kr319 kr

Den yttersta hemligheten

Bokrea

Del 6

Den yttersta hemligheten

149 kr329 kr

Röde Orm I : Sjöfarare i Västerled

Bokrea

Del 1

Röde Orm I : Sjöfarare i Västerled

Frans G. Bengtsson

99 kr299 kr

Väninnorna på Nordiska Kompaniet

Bokrea

Del 2

Väninnorna på Nordiska Kompaniet

Ruth Kvarnström-Jones

89 kr339 kr

Murdle Volym 1. 100 möjliga och omöjliga mordgåtor att lösa med hjälp av logik, skicklighet och förnuft

Bokrea

Murdle Volym 1. 100 möjliga och omöjliga mordgåtor att lösa med hjälp av logik, skicklighet och förnuft

89 kr299 kr