Automata, Languages and Programming : 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings - Livres de poche

EAN (ISBN-13): 9783540513711
ISBN (ISBN-10): 354051371X
Livre de poche
Date de parution: 1989
Editeur: Springer Berlin
804 Pages
Poids: 1,192 kg
Langue: eng/Englisch

Livre dans la base de données depuis 2007-09-23T21:05:06+02:00 (Paris)
Page de détail modifiée en dernier sur 2024-04-19T13:42:17+02:00 (Paris)
ISBN/EAN: 9783540513711

ISBN - Autres types d'écriture:
3-540-51371-X, 978-3-540-51371-1
Autres types d'écriture et termes associés:
Auteur du livre: simonetta, della rocca, ciancaglini, ronchi
Titre du livre: proceedings the international colloquium language, automata languages and programming, seven languages, lecture notes computer science automata, italy, tau 1989

---

Données de l'éditeur

Auteur: Giorgio Ausiello; Mariangiola Dezani-Ciancaglini; Simonetta Ronchi Della Rocca
Titre: Lecture Notes in Computer Science; Automata, Languages and Programming - 16th International Colloquium, Stresa, Italy, July 11-15, 1989. Proceedings
Editeur: Springer; Springer Berlin
790 Pages
Date de parution: 1989-06-28
Berlin; Heidelberg; DE
Langue: Anglais
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIV, 790 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; Graph; algorithms; automata; automata theory; complexity; computability; concurrency; formal language; linear optimization; logic; programming language; theorem proving; theoretical computer science; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Computer Science Logic and Foundations of Programming; Algorithms; Formal Languages and Automata Theory; Discrete Mathematics; Algorithmen und Datenstrukturen; Diskrete Mathematik; EA

Realizable and unrealizable specifications of reactive systems.- Limitations of the upward separation technique (preliminary version).- Lower bounds for the low hierarchy.- Efficient text searching of regular expressions.- Factors of words.- Asymptotically optimal distributed consensus.- Time lower bounds for CREW-PRAM computation of monotone functions.- Subduing self-application.- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds.- Polymorphic rewriting conserves algebraic strong normalization and confluence.- Completion of finite codes with finite deciphering delay.- Relational semantics for recursive types and bounded quantification.- A singly-exponential stratification scheme for real semi-algebraic varieties and its applications.- About primitive recursive algorithms.- The definability of equational graphs in monadic second-order logic.- Dominoes and the regularity of DNA splicing languages.- Causal trees.- Infinite normal forms.- On recent trends in algebraic specification.- Automata with storage on infinite words.- Parallel algorithmic techniques for combinatorial computation.- On dice and coins: models of computation for random generation.- An optimal probabilistic algorithm for synchronous Byzantine agreement.- Finding triconnected components by local replacements.- An improved algorithm for approximate string matching.- A pointer-free data structure for merging heaps and min-max heaps.- Structured operational semantics and bisimulation as a congruence.- Parallel retrieval of scattered information.- Tensor rank is NP-complete.- The complexity of nonlinear separable optimization.- General methods for the analysis of the maximum size of dynamic data structures.- How to share concurrent asynchronous wait-free variables.- A newapproach to formal language theory by kolmogorov complexity.- Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis.- Completing the temporal picture.- Lower bounds for computations with the floor operation.- Programming, transforming, and proving with function abstractions and memories.- Automata theory meets circuit complexity.- Two versus one index register and modifiable versus non-modifiable programs.- Shortest paths without a map.- Modular system design applying graph grammars techniques.- Partial communations.- On the synthesis of an asynchronous reactive module.- The complexity of controlled selection.- Memory versus randomization in on-line algorithms.- Syntactic control of interference Part 2.- Characteristic formulae.- A combinatorial technique for separating counting complexity classes.- Horn programs and semicomputable relations on abstract structures.- A note on model checking the modal v-calculus.- DI-domains as information systems.