Automata, languages, and programming : seventh colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980

שמור ב:
מידע ביבליוגרפי
מחבר תאגידי: International Colloquium on Automata, Languages and Programming :Noordwijkerhout, Pays-Bas
מחברים אחרים: Bakker, Jacobus Willem de, 1939- (Directeur de la publication), Leeuwen, Jan van, 1946- (Directeur de la publication)
פורמט: Livre numérique
שפה:Anglais
יצא לאור: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
סדרה:Lecture notes in computer science 85
נושאים:
גישה מקוונת:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
הערה: 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, seventh colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980, edited by J.W. de Bakker and J. van Leeuwen, Berlin, Springer-Verlag, 1980, 1 vol. (VIII-671 p.), Lecture notes in computer science, 0-387-10003-2
• Automata, Languages and Programming, Texte imprimé, 9783662192955
LEADER 05541nam a22004217a 4500
001 944824
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155203401
020 |a 9783540393467 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a International Colloquium on Automata, Languages and Programming  |n (07  |d  :1980  |c  :Noordwijkerhout, Pays-Bas). 
245 1 0 |a Automata, languages, and programming :  |b seventh colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980   |c edited by J.W. de Bakker and J. van Leeuwen. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 85  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a How to get rid of pseudoterminals -- Test sets for homomorphism equivalence on context free languages -- Languages with homomorphic replacements -- Functions equivalent to integer multiplication -- Languages with reducing reflexive types -- Semantics of unbounded nondeterminism -- A shifting algorithm for min-max tree partitioning -- A characterisation of computable data types by means of a finite equational specification method -- A note on sweeping automata -- Border rank of a p.q.2 tensor and the optimal approximation of a pair of bilinear forms -- Derivations et reductions dans les grammaires algebrioues -- Semantic analysis of communicating sequential processes -- Dos systems and languages -- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness -- Parameterized data types in algebraic specification languages -- Characterizing correctness properties of parallel programs using fixpoints -- Formal properties of one-visit and multi-pass attribute grammars (extended abstract) -- Cryptocomplexity and NP-completeness -- On the analysis of tree-matching algorithms -- Generating and searching sets induced by networks -- The complexity of the inequivalence problem for regular expressions with intersection -- An almost linear time algorithm for computing a dependency basis in a relational data base -- Bipolar synchronization systems -- Testing of properties of finite algebras -- A transaction model -- On observing nondeterminism and concurrency -- Terminal algebra semantics and retractions for abstract data types -- The complexity of semilinear sets -- A theory of nondeterminism -- A representation theorem for models of *-free PDL -- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions -- Symmertricspace-bounded computation (extended abstract) -- On some properties of local testability -- Semantics :Algebras,fixed points,axioms -- Measuring the expressive power of dynamic logics: An application of abstract model theory -- Pebbling mountain ranges and its application to DCFL-recognition -- Space-restricted attribute grammars -- A constructive approach to compiler correctness -- A worst-case analysis of nearest neighbor searching by projection -- Proprietes syntactiques du produit non ambigu -- On the optimal assignment of attributes to passes in multi-pass attribute evaluators -- Optimal unbounded search strategies -- A "fast implementation" of a multidimensional storage into a tree storage -- Grammatical families -- Partitioned chain grammars -- An improved program for constructing open hash tables -- On the power of commutativity in cryptography -- Characterizations of the LL(k) property -- Computability in categories -- On the size complexity of monotone formulas -- Reversible computing -- The use of metasystem transition in theorem proving and program optimization -- On the power of real-time turing machines under varying specifications. 
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 Langages de programmation 
650 |a Automates mathématiques, Théorie des 
650 |a Ordinateurs 
650 |a Logique symbolique et mathématique 
650 |a Actes de congrès 
700 1 |a Bakker, Jacobus Willem de,  |d 1939-  |4 pbd 
700 1 |a Leeuwen, Jan van,  |d 1946-  |4 pbd 
776 0 |0 025635999  |t Automata, languages, and programming  |o seventh colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980  |f edited by J.W. de Bakker and J. van Leeuwen  |c Berlin  |n Springer-Verlag  |d 1980  |p 1 vol. (VIII-671 p.)  |s Lecture notes in computer science  |z 0-387-10003-2 
776 0 |t Automata, Languages and Programming  |b Texte imprimé  |z 9783662192955 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-10003-2  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-ZQ13WF0Z-K  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747916179  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-10003-2  |z Accès Université d'Orléans 
856 4 |5 180339901:750928786  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-10003-2  |z Accès INSA CVL 
997 |0 944824  |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/