This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997.The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc.

Produktinformation

Utgivningsdatum1997-08-06
Mått155 x 235 x 27 mm
Vikt744 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor484
Upplaga1997
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540633860

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

The complexity class ? p 2 : Recent results and applications in AI and modal logic.- Proof systems for structured algebraic specifications: An overview.- Average-case analysis via incompressibility.- Locally computable enumerations.- The complexity of error-correcting codes.- Stochastic analysis of dynamic processes.- k-k Sorting on the multi-mesh.- Refinement of coloured petri nets.- Stratified petri nets.- Distributed acyclic orientation of asynchronous anonymous networks.- Generalized rational relations and their logical definability.- A note on broadcasting with linearly bounded transmission faults in constant degree networks.- Logics which capture complexity classes over the reals.- Criteria to disprove context-freeness of collage languages.- The subword complexity of fixed points of binary uniform morphisms.- Efficient parallel computing with memory faults.- Bounded concurrency.- Concerning the time bounds of existing shortest watchman route algorithms.- Query order in the polynomial hierarchy.- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria.- Pattern-matching problems for 2-dimensional images described by finite automata.- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups.- Contextual grammars with distributed catenation and shuffle.- A two-dimensional hierarchy for attributed tree transducers.- Synchronization of 1-way connected processors.- A linear-time heuristic for minimum rectangular coverings (Extended abstract).- On occurrence net semantics for petri nets with contacts.- Cellular automata universality revisited.- Trade-off results for connection management.- On the average complexity of the membership problem for a generalized Dycklanguage.- Towards optimal locality in mesh-indexings.- On the hierarchy of nondeterministic branching k-programs.- FDT is undecidable for finitely presented monoids with solvable word problems.- The equivalence of pebbles and sensing heads for finite automata.- From finite automata toward hybrid systems (Extended abstract).- On an optimal quantified propositional proof system nal proof system and a complete language for NP ? co-NP for NP ? co-NP.- Lower bounds in on-line geometric searching metric searching.- The complexity of universal text-learners.- Unique normal forms for nonlinear term rewriting systems: Root overlaps.- Behavioural characterizations of partial order logics.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Fundamentals of Computation Theory

Lothar Budach, Rais G. Bukharajev, Oleg B. Lupanov

Häftad, 1987

729 kr

Fundamentals of Computation Theory

Zoltan Esik

Häftad, 1993

749 kr

Del 12867

Fundamentals of Computation Theory

Evripidis Bampis, Aris Pagourtzis

Häftad, 2021

1 339 kr

Fundamentals of Computation Theory

Horst Reichel

Häftad, 1995

749 kr

Fundamentals of Computation Theory

Andrzej Lingas, Bengt J. Nilsson

Häftad, 2003

749 kr

Del 9210

Fundamentals of Computation Theory

Adrian Kosowski, Igor Walukiewicz

Häftad, 2015

749 kr

Fundamentals of Computation Theory

Marek Karpinski

Häftad, 1977

729 kr

Del 14292

Fundamentals of Computation Theory

Henning Fernau, Klaus Jansen

Häftad, 2023

1 189 kr

Fundamentals of Computation Theory

Lothar Budach

Häftad, 1991

749 kr

Del 16106

Fundamentals of Computation Theory

Artur Jeż, Jan Otop

Häftad, 2025

1 099 kr

Del i serien Lecture Notes in Computer Science

Fundamentals of Computation Theory

11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997. Proceedings

Häftad, Engelska, 1997

AvBogdan S. Chlebus,Ludwik Czaja

749 kr

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

Finns i fler format (10)

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

1 339 kr

Skickas inom 10-15 vardagar

Häftad

1 189 kr

Skickas inom 10-15 vardagar

Häftad

1 099 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

709 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1997-08-06
Mått155 x 235 x 27 mm
Vikt744 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor484
Upplaga1997
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540633860

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

The complexity class ? p 2 : Recent results and applications in AI and modal logic.- Proof systems for structured algebraic specifications: An overview.- Average-case analysis via incompressibility.- Locally computable enumerations.- The complexity of error-correcting codes.- Stochastic analysis of dynamic processes.- k-k Sorting on the multi-mesh.- Refinement of coloured petri nets.- Stratified petri nets.- Distributed acyclic orientation of asynchronous anonymous networks.- Generalized rational relations and their logical definability.- A note on broadcasting with linearly bounded transmission faults in constant degree networks.- Logics which capture complexity classes over the reals.- Criteria to disprove context-freeness of collage languages.- The subword complexity of fixed points of binary uniform morphisms.- Efficient parallel computing with memory faults.- Bounded concurrency.- Concerning the time bounds of existing shortest watchman route algorithms.- Query order in the polynomial hierarchy.- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria.- Pattern-matching problems for 2-dimensional images described by finite automata.- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups.- Contextual grammars with distributed catenation and shuffle.- A two-dimensional hierarchy for attributed tree transducers.- Synchronization of 1-way connected processors.- A linear-time heuristic for minimum rectangular coverings (Extended abstract).- On occurrence net semantics for petri nets with contacts.- Cellular automata universality revisited.- Trade-off results for connection management.- On the average complexity of the membership problem for a generalized Dycklanguage.- Towards optimal locality in mesh-indexings.- On the hierarchy of nondeterministic branching k-programs.- FDT is undecidable for finitely presented monoids with solvable word problems.- The equivalence of pebbles and sensing heads for finite automata.- From finite automata toward hybrid systems (Extended abstract).- On an optimal quantified propositional proof system nal proof system and a complete language for NP ? co-NP for NP ? co-NP.- Lower bounds in on-line geometric searching metric searching.- The complexity of universal text-learners.- Unique normal forms for nonlinear term rewriting systems: Root overlaps.- Behavioural characterizations of partial order logics.