Automata, languages, and programming : 12th colloquium, Nafplion, Greece, July 15-19, 1985
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
194 |
| Matèries: | |
| Accés en línia: | 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, 12th colloquium, Nafplion, Greece, July 15-19, 1985, edited by Wilfried Brauer, Berlin, Springer-Verlag, 1985, 1 vol. (VII-519 p.), Lecture notes in computer science, 0-387-15650-X • Automata, Languages and Programming, Texte imprimé, 9783662181164 |
| LEADER | 05492nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 944401 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155186884 | ||
| 020 | |a 9783540395577 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.3 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Colloquium on Automata, languages and programming |n (12 |d :1985 |c :Nafplion, Grèce). | |
| 245 | 1 | 0 | |a Automata, languages, and programming : |b 12th colloquium, Nafplion, Greece, July 15-19, 1985 |c edited by Wilfried Brauer. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 194 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Vertex 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 -- Thenearest 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. | |
| 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 Automates mathématiques, Théorie des | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Microordinateurs |x Programmation | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Brauer, Wilfried, |d 1937-2014. |4 pbd | |
| 776 | 0 | |0 026660660 |t Automata, languages, and programming |o 12th colloquium, Nafplion, Greece, July 15-19, 1985 |f edited by Wilfried Brauer |c Berlin |n Springer-Verlag |d 1985 |p 1 vol. (VII-519 p.) |s Lecture notes in computer science |z 0-387-15650-X | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662181164 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0015725 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-8FJPLTBL-S |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747919992 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0015725 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750932503 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0015725 |z Accès INSA CVL | |
| 997 | |0 944401 |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/ | ||