ISBN: 9783540392910
This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages… Mehr…
| Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540392910
This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages… Mehr…
| Springer.com new in stock. Versandkosten:spese di spedizione aggiuntive. (EUR 0.00) Details... |
ISBN: 9783540392910
This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages… Mehr…
| Springer.com Nr. 978-3-540-39291-0. Versandkosten:Worldwide free shipping, , zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540392910
Computer Science; Theory of Computation; Software Engineering/Programming and Operating Systems; Mathematics, general; Algorithm Analysis and Problem Complexity; Programming Techniques; P… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten Details... |
ISBN: 9783540392910
Computer Science; Theory of Computation; Software Engineering/Programming and Operating Systems; Mathematics, general; Algorithm Analysis and Problem Complexity; Programming Techniques; P… Mehr…
| Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540392910
This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages… Mehr…
ISBN: 9783540392910
This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages… Mehr…
ISBN: 9783540392910
This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages… Mehr…
ISBN: 9783540392910
Computer Science; Theory of Computation; Software Engineering/Programming and Operating Systems; Mathematics, general; Algorithm Analysis and Problem Complexity; Programming Techniques; P… Mehr…
ISBN: 9783540392910
Computer Science; Theory of Computation; Software Engineering/Programming and Operating Systems; Mathematics, general; Algorithm Analysis and Problem Complexity; Programming Techniques; P… Mehr…
Bibliographische Daten des bestpassenden Buches
| Autor: | |
| Titel: | |
| ISBN-Nummer: |
Detailangaben zum Buch - Automata, Languages and Programming
EAN (ISBN-13): 9783540392910
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-01-29T17:51:15+01:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-31T10:32:34+02:00 (Vienna)
ISBN/EAN: 9783540392910
ISBN - alternative Schreibweisen:
978-3-540-39291-0
Daten vom Verlag:
Autor/in: Timo Lepistö; Arto Salomaa
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - 15th International Colloquium, Tampere, Finland, July 11-15, 1988. Proceedings
Verlag: Springer; Springer Berlin
746 Seiten
Erscheinungsjahr: 2005-06-30
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIV, 746 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithms; automata; complexity; computer science; data structure; data structures; formal language; programming; programming language; robot; robotics; semantics; term rewriting; verification; algorithm analysis and problem complexity; C; Theory of Computation; Software Engineering; Mathematics; Algorithms; Programming Techniques; Compilers and Interpreters; Computer Science; Software Engineering; Mathematik; Algorithmen und Datenstrukturen; Computerprogrammierung und Softwareentwicklung; Compiler und Übersetzer; BC
Communication complexity of PRAMs.- Average case complexity analysis of the RETE multi-pattern match algorithm.- Problems easy for tree-decomposable graphs extended abstract.- Serializability in distributed systems with handshaking.- Algorithms for planar geometric models.- Nonuniform learnability.- Zeta functions of recognizable languages.- Dynamic programming on graphs with bounded treewidth.- Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's.- Optimal slope selection.- Approximation of a trace, asynchronous automata and the ordering of events in a distributed system.- New techniques for proving the decidability of equivalence problems.- Transitive orientations, möbius functions, and complete semi-thue systems for free partially commutative monoids.- The complexity of matrix transposition on one-tape off-line turing machines with output tape.- Geometric structures in computational geometry.- Arrangements of curves in the plane — topology, combinatorics, and algorithms.- Reset sequences for finite automata with application to design of parts orienters.- Random allocations and probabilistic languages.- Systolic architectures, systems and computations.- New developments in structural complexity theory.- Operational semantics of OBJ-3.- Do we really need to balance patricia tries?.- Contractions in comparing concurrency semantics.- A complexity theory of efficient parallel algorithms.- On the learnability of DNF formulae.- Efficient algorithms on context-free graph languages.- Efficient analysis of graph properties on context-free graph languages.- A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs.- Constructive Hopf's theorem: Or how to untangle closed planar curves.-Maximal dense intervals of grammar forms.- Computations, residuals, and the power of indeterminacy.- Nested annealing: A provable improvement to simulated annealing.- Nonlinear pattern matching in trees.- Invertibility of linear finite automata over a ring.- Moving discs between polygons.- Optimal circuits and transitive automorphism groups.- A Kleene-presburgerian approach to linear production systems.- On minimum flow and transitive reduction.- La Reconnaissance Des Facteurs D'un Langage Fini Dans Un Texte En Temps Lineaire - Resume -.- Regular languages defined with generalized quantifiers.- A dynamic data structure for planar graph embedding.- Separating polynomial-time turing and truth-table reductions by tally sets.- Assertional verification of a timer based protocol.- Type inference with partial types.- Some behavioural aspects of net theory.- The equivalence of dgsm replications on Q-rational languages is decidable.- Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs.- On restricting the access to an NP-oracle.- On ? 1?tt p -sparseness and nondeterministic complexity classes.- Semantics for logic programs without occur check.- Outer narrowing for equational theories based on constructors.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387088600 Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (G. Ausiello)
< zum Archiv...