000 | 04741nam a22004695i 4500 | ||
---|---|---|---|
001 | 978-3-540-39557-7 | ||
003 | DE-He213 | ||
005 | 20160624101944.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1985 gw | s |||| 0|eng d | ||
020 |
_a9783540395577 _9978-3-540-39557-7 |
||
024 | 7 |
_a10.1007/BFb0015725 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAutomata, Languages and Programming _h[electronic resource] : _b12th Colloquium Nafplion, Greece, July 15–19, 1985 / _cedited by Wilfried Brauer. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
300 |
_aXII, 524 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 ; _v194 |
|
505 | 0 | _aVertex packing algorithms -- Linear and branching structures in the semantics and logics of reactive systems -- About rational sets of factors of a bi-infinite word -- A fair protocol for signing contracts -- The influence of key length on the area-time complexity of sorting -- Repeated synchronous snapshots and their implementation in CSP -- On total regulators generated by derivation relations -- Optimal solutions for a class of point retrieval problems -- Fractional cascading: A data structuring technique with geometric applications -- Hierarchies of one-way multihead automata languages -- Partitioning point sets in 4 dimensions -- A completeness theorem for recursively defined types -- Categorical combinatory logic -- Towards a uniform topological treatment of streams and functions on streams -- Infinite streams and finite observations in the semantics of uniform concurrency -- Imposed-functional dependencies inducing horizontal decompositions -- Characterization of high level tree transducers -- Ambiguity and transcendence -- A fast algorithm for polygon containment by translation -- Deterministic and Las Vegas primality testing algorithms -- Efficient algorithms for graphic matroid intersection and parity -- Operational semantics for order-sorted algebra -- A universal domain technique for profinite posets -- A simple proof of the Skolem-Mahler-Lech theorem -- On complete problems for NP?CoNP -- An algebraic theory of fair asynchronous communicating processes -- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem -- Powerdomains as algebraic lattices preliminary report -- Random generation of combinatiorial structures from a uniform distribution -- Do rational equivalence relations have regular cross-sections? -- On probabilistic time and space -- The nearest neighbor problem on bounded domains -- Routing through a generalized switchbox -- On k-repetition free words generated by length uniform morphisms over a binary alphabet -- Every commutative quasirational language is regular -- A probabilistic distributed algorithm for set intersection and its analysis -- Distributed algorithms in synchronous broadcasting networks -- A context dependent equivalence between processes -- Lower bounds by kolmogorov-complexity -- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version) -- Applications of an infinite squarefree CO-CFL -- Special relations in automated deduction -- Dynamic interpolation search -- Polynomial levelability and maximal complexity cores -- Finite group topology and p-adic topology for free monoids -- On the use of relational expressions in the design of efficient algorithms -- The complementation problem for Büchi automata with applications to temporal logic -- A complete compositional modal proof system for a subset of CCS -- On matrix multiplication using array processors -- Optimal parallel pattern matching in strings -- Compositionality and concurrent networks: Soundness and completeness of a proofsystem. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
700 | 1 |
_aBrauer, Wilfried. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540156505 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v194 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0015725 |
942 |
_2EBK4658 _cEBK |
||
999 |
_c33952 _d33952 |