Automata, Languages and Programming 22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings - neues Buch

EAN (ISBN-13): 9783540600848
ISBN (ISBN-10): 3540600841
Taschenbuch
Erscheinungsjahr: 1995
Herausgeber: Springer Berlin
708 Seiten
Gewicht: 1,052 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-10-15T14:57:01+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-11T18:01:35+01:00 (Zurich)
ISBN/EAN: 9783540600848

ISBN - alternative Schreibweisen:
3-540-60084-1, 978-3-540-60084-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: fülöp, zoltan, gecseg, fülop, july, jan van leeuwen
Titel des Buches: 1995 band, programming languages, die automata, zehn, proceedings the international colloquium language, what saw hungary, szeged, lecture notes computer science automata

---

Daten vom Verlag:

Autor/in: Zoltan Fülöp; Ferenc Gecseg
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - 22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings
Verlag: Springer; Springer Berlin
692 Seiten
Erscheinungsjahr: 1995-06-28
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XVI, 692 p.

BC; Hardcover, Softcover / Technik/Elektronik, Elektrotechnik, Nachrichtentechnik; Regelungstechnik; Verstehen; Automat; algorithm; algorithms; automata; communication; complexity; formal language; programming; semantics; data structures; Control, Robotics, Automation; Compilers and Interpreters; Theory of Computation; Programming Techniques; Data Science; Cryptology; Compiler und Übersetzer; Theoretische Informatik; Computerprogrammierung und Softwareentwicklung; Datenbanken; Kodierungstheorie und Verschlüsselung (Kryptologie); Kryptografie, Verschlüsselungstechnologie; EA

Theory of 2-structures.- A domain for concurrent termination a generalization of Mazurkiewicz traces.- Nonfinite axiomatizability of the equational theory of shuffle.- The algebraic equivalent of AFL theory.- Finite state transformations of images.- Post correspondence problem: Words possible as primitive solutions.- Computing the closure of sets of words under partial commutations.- Intervalizing k-colored graphs.- NC algorithms for finding a maximal set of paths with application to compressing strings.- On the construction of classes of suffix trees for square matrices: Algorithms and applications.- How to use the minimal separators of a graph for its chordal triangulation.- Fast gossiping by short messages.- Break Finite Automata Public Key Cryptosystem.- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time.- On the number of random bits in totally private computation.- Lower time bounds for randomized computation.- New collapse consequences of NP having small circuits.- The complexity of searching succinctly represented graphs.- Optimal shooting: Characterizations and applications.- Placing resources in a tree: Dynamic and static algorithms.- Shortest path queries in digraphs of small treewidth.- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs.- Parallel algorithms with optimal speedup for bounded treewidth.- Approximating minimum cuts under insertions.- Linear time algorithms for dominating pairs in asteroidal triple-free graphs.- On-line resource management with applications to routing and scheduling.- Alternation in simple devices.- Hybrid automata with finite bisimulations.- Generalized Sturmian languages.- Polynomial closure and unambiguous product.- Lower bounds on algebraic random access machines.- Improved deterministic PRAM simulation on the mesh.- On optimal polynomial time approximations: P-levelability vs. ?-levelability.- Weakly useful sequences.- Graph Connectivity, Monadic NP and built-in relations of moderate degree.- The expressive power of clocks.- Grammar systems: A grammatical approach to distribution and cooperation.- Compactness of systems of equations in semigroups.- Sensing versus nonsensing automata.- New upper bounds for generalized intersection searching problems.- OKFDDs versus OBDDs and OFDDs.- Bicriteria network design problems.- On determining optimal strategies in pursuit games in the plane.- Extension orderings.- The pushdown method to optimize chain logic programs.- Automatic synthesis of real time systems.- Self-correcting for function fields of finite transcendental degree.- Measure, category and learning theory.- A characterization of the existence of energies for neural networks.- Variable-length codes for error correction.- Graphbots: Mobility in discrete spaces.- Solving recursive net equations.- Implicit definability and infinitary logic in finite model theory.- The limit of splitn-language equivalence.- Divergence and fair testing.- Causality for mobile processes.- Internal mobility and agent-passing calculi.
Includes supplementary material: sn.pub/extras