Mathematical Foundations of Computer Science 1993 - neues Buch

EAN (ISBN-13): 9783540571827
ISBN (ISBN-10): 3540571825
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1993
Herausgeber: Springer Berlin
804 Seiten
Gewicht: 1,192 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-04-14T18:35:46+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-26T20:36:30+01:00 (Zurich)
ISBN/EAN: 9783540571827

ISBN - alternative Schreibweisen:
3-540-57182-5, 978-3-540-57182-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: borzyszkowski, sokolowski, september, andrzej just, sokolow
Titel des Buches: mfc, gdansk, lecture notes computer science, 711, mathematical foundations computer science 1993, mfcs, symposium notes

---

Daten vom Verlag:

Autor/in: Andrzej M. Borzyszkowski; Stefan Sokolowski
Titel: Lecture Notes in Computer Science; Mathematical Foundations of Computer Science 1993 - 18th International Symposium, MFCS’93, Gdańsk, Poland, August 30–September 3, 1993 Proceedings
Verlag: Springer; Springer Berlin
786 Seiten
Erscheinungsjahr: 1993-08-18
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 2,450 kg
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
XIII, 786 p.

BC; Applications of Mathematics; Hardcover, Softcover / Mathematik/Sonstiges; Angewandte Mathematik; Verstehen; Complexity; Computer Science; Graph Theory; Komplexität; Lambda Calculus; Lambda-Kalküle; Process Algebras; Prozeßalgebren; Semantics; Semantik; algorithms; programming; algorithm analysis and problem complexity; Software Engineering/Programming and Operating Systems; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Applications of Mathematics; Software Engineering; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Software Engineering; Theoretische Informatik; Algorithmen und Datenstrukturen; EA

On the unification free prolog programs.- Equivalences and preorders of transition systems.- Deliverables: a categorical approach to program development in type theory.- Complex and complex-like traces.- Symbolic bisimulations (abstract).- Some results on the full abstraction problem for restricted lambda calculi.- Action calculi, or syntactic action structures.- Observable properties of higher order functions that dynamically create local names, or: What's new?.- The second calculus of binary relations.- An introduction to dynamic labeled 2-structures.- Post Correspondence Problem: Primitivity and interrelations with complexity classes.- A taste of linear logic.- On the tree inclusion problem.- On the adequacy of per models.- Hausdorff reductions to sparse sets and to sets of high information content.- Stores as homomorphisms and their transformations.- Comparative semantics for linear arrays of communicating processes.- Rabin tree automata and finite monoids.- Efficient type reconstruction in the presence of inheritance.- A characterization of Sturmian morphisms.- On the complexity of scheduling incompatible jobs with unit-times.- Isomorphisms between predicate and state transformers.- On the amount of nondeterminism and the power of verifying.- Observing distribution in processes.- Speedup of recognizable trace languages.- May I borrow your logic?.- Approximate and exact deterministic parallel selection.- Defining soft sortedness by abstract interpretation.- A model for real-time process algebras (extended abstract).- Data encapsulation and modularity: Three views of inheritance.- Image compression using Weighted Finite Automata.- Filter models for a parallel and non deterministic ?-calculus.- Real number computability and domain theory.- Lambda substitution algebras.- Global properties of 2D cellular automata: some complexity results.- Completeness results for linear logic on Petri nets.- An expressive logic for Basic Process Algebra.- The complexity of finding replicas using equality tests.- A complete axiomatization for branching bisimulation congruence of finite-state behaviours.- Object Oriented application flow graphs and their semantics.- Some hierarchies for the communication complexity measures of cooperating grammar systems.- Efficient parallel graph algorithms based on open ear decomposition.- On the communication complexity of parallel computation.- A taxonomy of forgetting automata.- Hybrid parallel programming and implementation of synchronised communication.- Proof systems for cause based equivalences.- A uniform universal CREW PRAM.- Observing located concurrency.- The boundary of substitution systems.- New algorithms for detecting morphic images of a word.- Ignoring nonessential interleavings in assertional reasoning on concurrent programs.- Constant time reductions in ?-calculus.- Heterogeneous unified algebras.- A representation theorem for lambda abstraction algebras.- On saturated calculi for a linear temporal logic.- The snack powerdomain for database semantics.- Verifying properties of module construction in type theory.- On time-space trade-offs in dynamic graph pebbling.- Deterministic behavioural models for concurrency.- Real-time refinement: Semantics and application.- Deciding testing equivalence for real-time processes with dense time.- A calculus for higher order procedures with global variables.- Variable substitution with iconic combinators.- Feature constraints with first-class features.- Between Min Cut and Graph Bisection.- Paths and cycles in finite periodic graphs.- Learning decision lists from noisy examples.- Analytic tableaux for finite and infinite Post logics.