Automata, languages, and programming : ninth colloquium, Aarhus, Denmark, July 12-16, 1982
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
140 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
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, ninth colloquium, Aarhus, Denmark, July 12-16, 1982, edited by M[ogens] Nielsen, and E[rik] M[eineche] Schmidt, Berlin, Springer-Verlag, 1982, 1 vol. (vii, 613 p.), Lecture notes in computer science, 0-387-11576-5 • Automata, Languages and Programming, Texte imprimé, 9783540115762 • Automata, Languages and Programming, Texte imprimé, 9783662174494 |
| LEADER | 05305nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 945432 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155227335 | ||
| 020 | |a 9783540393085 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 519.4 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Colloquium on Automata, Languages and Programming |n (09 |d :1982 |c :Aarhus). | |
| 245 | 1 | 0 | |a Automata, languages, and programming : |b ninth colloquium, Aarhus, Denmark, July 12-16, 1982 |c edited by M. Nielsen and E.M. Schmidt. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 140 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Locality in modular systems -- On-the-fly garbage collection: New algorithms inspired by program proofs -- Algebraic specifications for parametrized data types with minimal parameter and target algebras -- A modification of the ?-calculus as a base for functional programming languages -- On the power of nondeterminism in dynamic logic -- Equivalence and membership problems for regular trace languages -- On the power of chain rules in context free grammars -- Extended Chomsky-Schützenberger theorems -- Real time agents -- Machine inductive inference and language identification -- Approximations of infinitary objects -- On test sets and the Ehrenfeucht conjecture -- An automata-theoretic characterization of the OI-hierarchy -- Fast detection of polyhedral intersections -- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store -- Multihead finite state automata am concatenation -- Conditions enforcing regularity of context-free languages -- Repetitions in homomorphisms and languages -- Parameter passing commutes with implementation of parameterized data types -- An operational semantics for pure dataflow -- Some properties of D-continuous causal nets -- A branching process arising in dynamic hashing, trie searching and polynomial factorization -- A sound and complete HOARE axiomatization of the ADA-rendezvous -- Universal realization, persistent interconnection and implementation of abstract modules -- Heaps on heaps -- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties -- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems -- A programming language for the inductive sets, and applications -- A lower bound for the formula size of rational functions -- On theequivalence problem for binary DOL systems -- Results on the propositional ?-calculus -- An iteration theorem for simple precedence languages -- The power of non-rectilinear holes -- Fixed-point semantics for algebraic (tree) grammars -- Completing biprefix codes -- Advances in pebbling -- A powerdomain for countable non-determinism -- Properties of a notation for combining functions -- On the power of probabilistic choice in synchronous parallel computations -- Biprefix codes and semisimple algebras -- Algorithmic theories of data structures -- Implementation of parameterised specifications -- Algebraic semantics of recursive flowchart schemes -- The complexity of promise problems -- Global and local invariants in transition systems -- On relativization and the existence of complete sets -- Semantics of interference control -- Efficient simulations of multicounter machines -- Event structure semantics for CCS and related languages -- Domains for denotational semantics. | |
| 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 Langages formels | ||
| 650 | |a Algorithmes | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Nielsen, Mogens, |d 1949- |4 pbd | |
| 700 | 1 | |a Schmidt, Erik Meineche, |d 1945- |4 pbd | |
| 776 | 0 | |0 024731048 |t Automata, languages, and programming |o ninth colloquium, Aarhus, Denmark, July 12-16, 1982 |f edited by M[ogens] Nielsen, and E[rik] M[eineche] Schmidt |c Berlin |n Springer-Verlag |d 1982 |p 1 vol. (vii, 613 p.) |s Lecture notes in computer science |z 0-387-11576-5 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783540115762 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662174494 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0012751 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-DMC5VBXT-Z |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747910561 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0012751 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750923458 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0012751 |z Accès INSA CVL | |
| 997 | |0 945432 |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/ | ||