Automata, languages, and programming : eighth colloquium, Acre (Akko), Israel, July 13-17, 1981
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
115 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
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, eighth colloquium, Acre (Akko), Israel, July 13-17, 1981, edited by S. Even and O. Kariv, 1981, Berlin, Springer-Verlag, 1 vol. (VIII-550 p.), Lecture notes in computer science, 3-540-10843-2 • Automata, Languages and Programming, Texte imprimé, 9783662185551 |
| LEADER | 05164nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 945677 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155236989 | ||
| 020 | |a 9783540387459 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 519.4 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International colloquium on automata, languages and programming |n (08 |d :1981 |c :Acre, Israël). | |
| 245 | 1 | 0 | |a Automata, languages, and programming : |b eighth colloquium, Acre (Akko), Israel, July 13-17, 1981 |c edited by S. Even and O. Kariv. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 115 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Refined analysis and improvements on some factoring algorithms -- Absolute primality of polynomials is decidable in random polynomial time in the number of variables -- Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform -- Cost tradeoffs in graph embeddings, with applications -- Minimum s-t cut of a planar undirected network in o(n log2(n)) time -- On the density of color-families -- The implication problem for data dependencies -- Characterizing data base Dependencies -- Data flow analysis of applicative programs -- Flow analysis of lambda expressions -- Algorithmic specifications of abstract data types -- Nondeterminism in abstract data types -- A view of directions in relational database theory -- A new characterization of the regular languages -- Langages Reconnaissables et Codage Prefixe Pur -- Passes, sweeps and visits -- On LALR(k) testing -- On size bounds for deterministic parsers -- A decision procedure for the equivalence of two dpdas one of which is linear -- The deducibility problem in Propositional Dynamic Logic -- Finite models for deterministic propositional dynamic logic -- Impartiality, justice and fairness: The ethics of concurrent termination -- Computing a perfect strategy for n.n chess requires time exponential in n -- On the complexity of simple arithmetic expressions -- Proving lower bounds for linear decision trees -- Parikh-bounded languages -- Generalized Parikh mappings and homomorphisms -- Chomsky-Schotzenberger representations for families of languages and grammatical types -- Algebraically specified programming systems and Hoare's logic -- Automatic construction of verification condition generators from hoare logics -- Circular expressions: Elimination of static environments -- An axiomatic approach to the Korenjak -Hopcroft algorithms -- On the (generalized) post correspondence problem with lists of length 2 -- A sparse table implementation of priority queues -- Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems -- Termination of linear rewriting systems -- Realizing an equational specification -- A cook's tour of countable nondeterminism -- The complexity of decision problems for finite-turn multicounter machines -- Alternating multihead finite automata -- The solution for the branching factor of the alpha-beta pruning algorithm -- Uniform complexity and digital signatures -- On the generation of cryptographically strong pseudo-random sequences -- Measuring the expressive power of dynamic logics: An application of abstract model theory. | |
| 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 Langages de programmation | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Théorie des machines séquentielles | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Even, Shimon, |d 1935-2004. |4 pbd | |
| 700 | 1 | |a Kariv, Oded, |d 1944- |4 pbd | |
| 776 | 0 | |0 024226157 |t Automata, languages, and programming |o eighth colloquium, Acre (Akko), Israel, July 13-17, 1981 |f edited by S. Even and O. Kariv |d 1981 |c Berlin |n Springer-Verlag |p 1 vol. (VIII-550 p.) |s Lecture notes in computer science |z 3-540-10843-2 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662185551 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-10843-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-TBT7B0M8-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747908508 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-10843-2 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750921463 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-10843-2 |z Accès INSA CVL | |
| 997 | |0 945677 |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/ | ||