000 05440nam a22004575i 4500
001 978-3-540-47747-1
003 DE-He213
005 20160624102026.0
007 cr nn 008mamaa
008 121227s1987 gw | s |||| 0|eng d
020 _a9783540477471
_9978-3-540-47747-1
024 7 _a10.1007/3-540-18088-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAutomata, Languages and Programming
_h[electronic resource] :
_b14th International Colloquium Karlsruhe, Federal Republic of Germany, July 13–17, 1987 Proceedings /
_cedited by Thomas Ottmann.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1987.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1987.
300 _aX, 565 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v267
505 0 _aProbability and plurality for aggregations of learning machines -- Logic programming with ions -- Inverse image analysis -- A unification algorithm for confluent theories -- On the Knuth-Bendix completion for concurrent processes -- On word problems in equational theories -- Semantics for nondeterministic asynchronous broadcast networks -- Another look at abstraction in process algebra -- A timed failures model for extended communicating processes -- Readiness semantics for regular processes with silent actions -- Verifying a protocol using relativized bisimulation -- On recent trends in formal language theory -- Non-uniform automata over groups -- Minimal automaton of a rational cover -- A star-height problem in free monoids with partial commutations -- Single-valued finite transduction -- The kleene and the Parikh Theorem in complete semirings -- An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs -- On the languages accepted by finite reversible automata -- Decision problems for regular trace languages -- Panic mode without panic -- Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree -- Modelchecking of CTL formulae under liveness assumptions -- A modal logic for a subclass of event structures -- Parallel 5-colouring of planar graphs -- Parallel construction of a suffix tree -- The probabilistic and deterministic parallel complexity of symmetric functions -- Term matching on parallel computers -- Guessing games and distributed computations in synchronous networks -- On the bivariate function minimization problem and its applications to motion planning -- Testing the necklace condition for Shortest Tours and optimal factors in the plane -- Nearly optimal heuristics for binary search trees with geometric generalizations -- Approximating integer lattices by lattices with cyclic factor groups -- On the complexity of graph critical uncolorability -- Posets, boolean representations and quick path searching -- The lexicographically first maximal subgraph problems: P-completeness and NC algorithms -- Uniform computational complexity of Taylor series -- Efficient on-line algorithms for the knapsack problem -- Lower bounds for sorting of sums -- The I/O complexity of sorting and related problems -- A lower bound for the complexity of the Union-Split-Find problem -- The nearest common ancestor in a dynamic tree -- A generalization of the procedure of karp and miller to well structured transition systems -- Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems -- Partial algebras flow from algebraic specifications -- The logarithmic alternation hierarchy collapses: $$A\Sigma _2^\mathcal{L} = A\Pi _2^\mathcal{L}$$ -- Testing membership in commutative transformation semigroups -- On the computing power of one-way cellular arrays -- Recent developments in the theory of learning.
520 _aThis volume contains the proceedings of the 14th International Colloquium on Automata Languages and Programming, organized by the European Association for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics of programming languages, program specification, transformation and verification, theory of data bases, logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, cryptography, and theory of robotics. The authors are young scientists and leading experts in these areas.
650 0 _aComputer science.
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aOttmann, Thomas.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540180883
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v267
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-18088-5
942 _2EBK6171
_cEBK
999 _c35465
_d35465