000 04817nam a22004935i 4500
001 978-3-540-38886-9
003 DE-He213
005 20160624101941.0
007 cr nn 008mamaa
008 121227s1984 gw | s |||| 0|eng d
020 _a9783540388869
_9978-3-540-38886-9
024 7 _a10.1007/3-540-13345-3
_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] :
_b11th Colloquium Antwerp, Belgium, July 16–20, 1984 /
_cedited by Jan Paredaens.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1984.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1984.
300 _aX, 530 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 ;
_v172
505 0 _aThe theory of data dependencies — An overview -- The VLSI revolution in theoretical circles -- Tuple sequences and indexes -- The complexity of cubical graphs -- P-generic sets -- Functional dependencies and disjunctive existence constraints in database relations with null values -- The algebra of recursively defined processes and the algebra of regular processes -- Algebraic specification of exception handling and error recovery by means of declarations and equations -- Building the minimal DFA for the set of all subwords of a word on-line in linear time -- The complexity and decidability of separation -- Concurrent transmissions in broadcast networks -- Linear searching for a square in a word -- Domain algebras -- Principality results about some matrix languages families -- Oriented equational clauses as a programming language -- Relational algebra operations and sizes of relations -- Some results about finite and infinite behaviours of a pushdown automaton -- On the relationship of CCS and petri nets -- Communicating finite state machines with priority channels -- A modal characterization of observational congruence on finite terms of CCS -- Communication complexity -- Space and time efficient simulations and characterizations of some restricted classes of PDAS -- A complete axiom system for algebra of closed-regular expression -- The complexity of finding minimum-length generator sequences -- On probabilistic tape complexity and fast circuits for matrix inversion problems -- On three-element codes -- Recursion depth analysis for special tree traversal algorithms -- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem -- Measures of presortedness and optimal sorting algorithms -- Languages and inverse semigroups -- Area-time optimal vlsi integer multiplier with minimum computation time -- On the interpretation of infinite computations in logic programming -- A linear time algorithm to solve the single function coarsest partition problem -- Complexité des facteurs des mots infinis engendrés par morphismes itérés -- Automates boustrophedon, semi-groupe de birget et monoide inversif libre -- Probabilistic bidding gives optimal distributed resource allocation -- Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness -- Cancellation, pumping and permutation in formal languages -- A hardware implementation of the CSP primitives and its verification -- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm -- Robust algorithms: A different approach to oracles -- Node weighted matching -- The propositional mu-calculus is elementary -- AVL-trees for localized search -- The simple roots of real-time computation hierarchies -- Computational complexity of an optical disk interface -- Encoding graphs by derivations and implications for the theory of graph grammars -- Sampling algorithms for differential batch retrieval problems (extended abstract).
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aParedaens, Jan.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540133452
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v172
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-13345-3
942 _2EBK4560
_cEBK
999 _c33854
_d33854