ISBN: 9783540186250
Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automat… Mehr…
| Indigo.ca new in stock. Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540186250
Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automat… Mehr…
| Indigo.ca new in stock. Versandkosten:zzgl. Versandkosten. Details... |
1987, ISBN: 3540186255
[EAN: 9783540186250], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS EDV THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING INTELLIGENZ KüNSTLICHE KI - AI MATHEMATIK ALGORITHMS AUTOMA… Mehr…
| AbeBooks.de moluna, Greven, Germany [73551232] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
1987, ISBN: 9783540186250
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Algebraic operational sem… Mehr…
| booklooker.de |
1987, ISBN: 9783540186250
Seventh Conference, Pune, India, December 17-19, 1987. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1987
| lehmanns.de Versandkosten:Versand in 10-14 Tagen. (EUR 0.00) Details... |
Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. Procee - neues Buch
ISBN: 9783540186250
Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automat… Mehr…
ISBN: 9783540186250
Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automat… Mehr…
1987
ISBN: 3540186255
[EAN: 9783540186250], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS EDV THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING INTELLIGENZ KüNSTLICHE KI - AI MATHEMATIK ALGORITHMS AUTOMA… Mehr…
1987, ISBN: 9783540186250
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Algebraic operational sem… Mehr…
1987, ISBN: 9783540186250
Seventh Conference, Pune, India, December 17-19, 1987. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1987
Bibliographische Daten des bestpassenden Buches
| Autor: | |
| Titel: | |
| ISBN-Nummer: |
Detailangaben zum Buch - Foundations of Software Technology and Theoretical Computer Science
EAN (ISBN-13): 9783540186250
ISBN (ISBN-10): 3540186255
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1987
Herausgeber: Springer Berlin
556 Seiten
Gewicht: 0,830 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-04-17T00:51:36+02:00 (Vienna)
Detailseite zuletzt geändert am 2022-05-18T11:33:15+02:00 (Vienna)
ISBN/EAN: 9783540186250
ISBN - alternative Schreibweisen:
3-540-18625-5, 978-3-540-18625-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: goos
Titel des Buches: lecture notes, war 1987, nori, foundations software technology and theoretical computer science, foundation, the science and technology the, proceedings all india
Daten vom Verlag:
Autor/in: Kesav V. Nori
Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - Seventh Conference, Pune, India, December 17-19, 1987. Proceedings
Verlag: Springer; Springer Berlin
541 Seiten
Erscheinungsjahr: 1987-11-25
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
IX, 541 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Software Engineering; Verstehen; Algorithms; Automat; algorithm; automata; computer; distributed computing; formal language; logic; programming; algorithm analysis and problem complexity; Software Engineering; Computer System Implementation; Programming Techniques; Algorithms; Theory of Computation; Systemanalyse und -design; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Theoretische Informatik; EA
Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automata to the succinctness of their representation.- Automata, games, and positive monadic theories of trees.- An algorithm for colouring perfect planar graphs.- Efficient algorithms for domination and Hamilton circuit problems on permutation graphs.- Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs.- Improved bounds for covering general polygons with rectangles.- Submodule construction as equation solving in CCS.- Computations in undistinguished networks.- A distributed algorithm to implement n-party rendezvous.- Merge and termination in process algebra.- Parallelism and programming: A perspective.- On optimal parallelization of sorting networks.- Parallel algorithms for approximate edge colouring of simple graphs.- An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks.- An O(n2) algorithm for fan-out free query optimization.- Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols.- Optimizing join queries in distributed databases.- Reasoning in systems of equations and inequations.- Specification=program+types.- Paraconsistent logic programming.- Semantics of distributed Horn clause programs.- The calculus of constructions : State of the art.- Modules for re-use.- Hierarchical refinement of A Z specification.- Lazy pattern matching in the ML language.- Program development using lambda abstraction.- Relativized Arthur-Merlin versus Merlin-Arthur games.- Probabilistic quantifiers vs. distrustful adversaries.- On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas.- A look-ahead interpreter for sequential Prolog and its implementation.- Extension of weakest precondition formalism to a low level language.- Retrospection on the PQCC compiler structure.- Some recent applications of knowledge.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387587158 Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15-17, 1994 : Proceedings (P. S. Thiagarajan)
- 9780387587158 Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15-17, 1994 : Proceedings (P. S. Thiagarajan)
- 9780387138831 Foundations of Software Technology and Theoretical Computer Science (Lecture Notes in Computer Science) (Editor-Mathai Joseph)
- 9780387534879 Foundations of Software Technology and Theoretical Computer Science 10th Conference, Bangalore, India, Dec. 17-19, 1990 Proceedings (Lecture Notes in Computer Science) (Kesav V. Nori)
- 9780387549675 Foundations of Software Technology and Theoretical Computer Science 11th Conference, New Delhi, India December 17-19, 1991 Proceedings (S. Biswas; Editor-Kesav V. Nori)
- 9780387171791 Foundations of Software Technology and Theoretical Computer Science: Sixth Conference, New Delhi, India December 18-20, 1986 Proceedings (Editor-Kesav V. Nori)
- 9780387575292 Foundations of Software Technology and Theoretical Computer Science: 13th Conference Bombay, India, December 15-17, 1993 : Proceedings (R. K. Shyamasundar)
- FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. (Hariharan, Ramesh et al. (Eds.))
< zum Archiv...