



LEADER 
04507nmm a2200397 u 4500 
001 
EB000659575 
003 
EBX01000000000000001349652 
005 
00000000000000.0 
007 
cr 
008 
140122  eng 
020 


a 9783540695295

100 
1 

a Chlebus, Bogdan S.
e [editor]

245 
0 
0 
a Fundamentals of Computation Theory
h Elektronische Ressource
b 11th International Symposium, FCT '97, Krakow, Poland, September 13, 1997. Proceedings
c edited by Bogdan S. Chlebus, Ludwik Czaja

250 


a 1st ed. 1997

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 1997, 1997

300 


a XII, 484 p
b online resource

505 
0 

a Query order in the polynomial hierarchy  Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria  Patternmatching problems for 2dimensional 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 twodimensional hierarchy for attributed tree transducers  Synchronization of 1way connected processors  A lineartime heuristic for minimum rectangular coverings (Extended abstract)  On occurrence net semantics for petri nets with contacts  Cellular automata universality revisited  Tradeoff results for connection management  On the average complexity of the membership problem for a generalized Dycklanguage  Towards optimal locality in meshindexings  On the hierarchy of nondeterministic branching kprograms 

505 
0 

a The complexity class ? p 2 : Recent results and applications in AI and modal logic  Proof systems for structured algebraic specifications: An overview  Averagecase analysis via incompressibility  Locally computable enumerations  The complexity of errorcorrecting codes  Stochastic analysis of dynamic processes  kk Sorting on the multimesh  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 contextfreeness 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 

505 
0 

a 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 ? coNP for NP ? coNP  Lower bounds in online geometric searching metric searching  The complexity of universal textlearners  Unique normal forms for nonlinear term rewriting systems: Root overlaps  Behavioural characterizations of partial order logics

653 


a Artificial intelligence / Data processing

653 


a Computer graphics

653 


a Computer science

653 


a Computer science / Mathematics

653 


a Discrete Mathematics in Computer Science

653 


a Computer Graphics

653 


a Discrete mathematics

653 


a Theory of Computation

653 


a Data Science

700 
1 

a Czaja, Ludwik
e [editor]

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

028 
5 
0 
a 10.1007/BFb0036167

856 
4 
0 
u https://doi.org/10.1007/BFb0036167?nosfx=y
x Verlag
3 Volltext

082 
0 

a 40,151

520 


a 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
