Automata, languages, and programming : 11th colloquium, Antwerp, Belgium, July 16-20, 1984
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
172 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata, languages, and programming, 11th colloquium, Antwerp, Belgium, July 16-20, 1984, edited by Jan Paredaens, 1984, Berlin, Springer, 1 vol. (VI-526 p.), Lecture notes in computer science, 0-387-13345-3 • Automata, Languages, and Programming, Texte imprimé, 9783662180563 |
| LEADER | 05432nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 944691 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155197878 | ||
| 020 | |a 9783540388869 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 511 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Colloquium on Automata, Languages and Programming |n (11 |d :1984 |c :Anvers, Belgique). | |
| 245 | 1 | 0 | |a Automata, languages, and programming : |b 11th colloquium, Antwerp, Belgium, July 16-20, 1984 |c edited by Jan Paredaens. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 172 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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 multiplierwith 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). | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Automates | ||
| 650 | |a Langages de 4e génération | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Paredaens, Jan, |d 1947- |4 pbd | |
| 776 | 0 | |0 025826549 |t Automata, languages, and programming |o 11th colloquium, Antwerp, Belgium, July 16-20, 1984 |f edited by Jan Paredaens |d 1984 |c Berlin |n Springer |p 1 vol. (VI-526 p.) |s Lecture notes in computer science |z 0-387-13345-3 | |
| 776 | 0 | |t Automata, Languages, and Programming |b Texte imprimé |z 9783662180563 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-13345-3 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-P0BXQLHK-D |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747917361 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-13345-3 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750929944 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-13345-3 |z Accès INSA CVL | |
| 997 | |0 944691 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||