06075nam 22007215 450 99646612730331620200707030026.03-540-38886-910.1007/3-540-13345-3(CKB)1000000000230350(SSID)ssj0000321512(PQKBManifestationID)11227083(PQKBTitleCode)TC0000321512(PQKBWorkID)10279535(PQKB)10352248(DE-He213)978-3-540-38886-9(PPN)155197878(EXLCZ)99100000000023035020121227d1984 u| 0engurnn|008mamaatxtccrAutomata, Languages, and Programming[electronic resource] 11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings /edited by J. Paredaens1st ed. 1984.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1984.1 online resource (X, 530 p.)Lecture Notes in Computer Science,0302-9743 ;172Bibliographic Level Mode of Issuance: Monograph3-540-13345-3 The 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).Lecture Notes in Computer Science,0302-9743 ;172ComputersComputer programmingProgramming languages (Electronic computers)AlgorithmsComputer logicMathematical logicComputation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Computers.Computer programming.Programming languages (Electronic computers).Algorithms.Computer logic.Mathematical logic.Computation by Abstract Devices.Programming Techniques.Programming Languages, Compilers, Interpreters.Algorithm Analysis and Problem Complexity.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.004.0151Paredaens Jedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466127303316Automata, languages and programming339738UNISA