LEADER 07022nam 22007335 450 001 996465477203316 005 20200702132017.0 010 $a3-540-47278-9 024 7 $a10.1007/3-540-55719-9 035 $a(CKB)1000000000233851 035 $a(SSID)ssj0000321494 035 $a(PQKBManifestationID)11271154 035 $a(PQKBTitleCode)TC0000321494 035 $a(PQKBWorkID)10279573 035 $a(PQKB)10980571 035 $a(DE-He213)978-3-540-47278-0 035 $a(PPN)15520775X 035 $a(EXLCZ)991000000000233851 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e19th International Colloquium, Wien, Austria, July 13-17, 1992. Proceedings /$fedited by Werner Kuich 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XII, 724 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v623 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55719-9 327 $aPhilosophical issues in Kolmogorov complexity -- Circuit complexity and the expressive power of generalized first-order formulas -- One-message statistical Zero-Knowledge Proofs and space-bounded verifier -- Abelian squares are avoidable on 4 letters -- Polynomial size test sets for context-free languages -- Quasi-deterministic 0L systems -- On growing context-sensitive languages -- Numeration systems, linear recurrences, and regular sets -- The equality problem for rational series with multiplicities in the tropical semiring is undecidable -- Semi-commutations and rational expressions -- New results concerning synchronized finite automata -- A Greibach normal form for context-free graph grammars -- On reverse and general definite tree languages -- Reductions to sets of low information content -- UP and the low and high hierarchies: A relativized separation -- Analytic analysis of algorithms -- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems -- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects -- Polynomial hash functions are reliable -- Adaptive pattern matching -- Randomized interpolation and approximation of sparse polynomials stPreliminary version -- Two strikes against perfect phylogeny -- Disjunctive systems and L-Domains -- Optimal parallel algorithms for periods, palindromes and squares -- Near-perfect token distribution -- Fast integer merging on the EREW PRAM -- Approximation algorithms for graph augmentation -- Fast incremental planarity testing -- Maintenance of triconnected components of graphs -- Suboptimal cuts: Their enumeration, weight and number -- Gröbner bases: An introduction -- Buchberger's algorithm: The term rewriter's point of view -- Completion of rewrite systems with membership constraints -- A new metric between polygons, and how to compute it -- On nearest-neighbor graphs -- A tail estimate for Mulmuley's segment intersection algorithm -- Lower bounds on the complexity of simplex range reporting on a pointer machine -- Infinitary logic for computer science -- Characterization of temporal property classes -- Lazy Lambda calculus: Theories, models and local structure characterization -- Logic programming semantics made easy -- On the complexity of dataflow analysis of logic programs -- Comparison of abstract interpretations -- A proposed categorical semantics for Pure ML -- What good are digital clocks? -- Behavioural abstraction in TCCS -- Timing Petri Nets categorically -- Asynchronous cellular automata for infinite traces -- A trace semantics for Petri Nets -- Asynchronous communication of Petri Nets and the refinement of transitions -- A parametric approach to localities -- Proved trees -- Interfaces between languages for communicating systems -- Toward formal development of programs from algebraic specifications: Model-theoretic foundations -- Program composition via unification -- Barbed bisimulation -- Checking equivalences between concurrent systems of finite agents (Extended abstract) -- Testing preorders for probabilistic processes. 330 $aThis volume presents the proceedings of the 19th International Colloquium onAutomata, Languages, and Programming (ICALP 92) in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP is a broadly based conference covering all aspects of theoretical computer science, including such topics as computability, automata, formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design andlayout, parallel and distributed computation, theory of concurrency, and theory of robotics. The papers in the volume are grouped into thematic parts corresponding to their order of presentation at ICALP 92. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v623 606 $aComputers 606 $aComputer logic 606 $aAlgorithms 606 $aMathematical logic 606 $aData structures (Computer science) 606 $aCombinatorics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aComputer logic. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 0$aData structures (Computer science). 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aLogics and Meanings of Programs. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aMathematical Logic and Formal Languages. 615 24$aData Structures. 615 24$aCombinatorics. 676 $a004.0151 702 $aKuich$b Werner$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465477203316 996 $aAutomata, languages and programming$9339738 997 $aUNISA LEADER 01084nlm 2200253Ia 450 001 996536471903316 005 20230704094153.0 100 $a19840411d1658---- uy | 101 0 $aeng 102 $aUK 135 $adrcnu 200 1 $aSome of the principles of the Quakers (scornfully so called by men) vindicated and proved sound and true and according to the Scriptures$ein oposition to the false charges and lying reports given forth against the truth in two printed books put forth by one Philip Taverner, a supposed minister of the Gospel in Middlesex near Vxbridge ...$fby Edw. Burrough 210 1 $aLondon$c[s.n]$d1658 215 $aTesto elettronico (PDF) (23 p.) 230 $aBase dati testuale 606 0 $aQuaccheri$2BNCF 676 $a289.6 700 1$aBURROUGH,$bEdward$f1634-1662.$01001305 801 0$aIT$bcba$cREICAT 912 $a996536471903316 959 $aEB 969 $aER 996 $aSome of the principles of the Quakers (scornfully so called by men) vindicated and proved sound and true and according to the Scriptures$93393361 997 $aUNISA