Buy Mathematical Foundations of Computer Science 1991 by Andrzej Tarlecki
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings(520 Lecture Notes in Computer Science)
Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings(520 Lecture Notes in Computer Science)

Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings(520 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



Available


X
About the Book

This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.

Table of Contents:
Elimination of negation in term algebras.- Rewrite orderings and termination of rewrite systems.- On the faithfulness of formal models.- Models for concurrency.- On a hierarchy of file types and a tower of their theories.- Strong conjunction and intersection types.- Partial higher-order specifications.- Unification in incompletely specified theories: A case study.- Observing localities.- Abstract dynamic data types: A temporal logic approach.- Generating words by cellular automata.- Atomic refinement in process description languages.- Recognizable complex trace languages (abstract).- Solving systems of linear diophantine equations: An algebraic approach.- A second-order pattern matching algorithm for the cube of typed ?-calculi.- The lazy call-by-value ?-calculus.- The limit of split n -bisimulations for CCS agents.- Stochastic automata and length distributions of rational languages.- Towards a categorical semantics of type classes.- Single-path Petri nets.- The bisection problem for graphs of degree 4 (configuring transputer systems).- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata.- Infinite normal forms for non-linear term rewriting systems.- Two algorithms for approxmate string matching in static texts.- Efficient constructions of test sets for regular and context-free languages.- The complexity of the reliable connectivity problem.- Pattern matching in order-sorted languages.- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus.- A solution of the complement problem in associatiue-commutatiue theories.- A model for real-time systems.- On strict codes.- A decidable case of the semi-unification problem.- Maintaining dictionaries in a hierarchical memory.-Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs.- CCS dynamic bisimulation is progressing.- Syntax and semantics of a monotonic framework for non-monotonic reasoning.- On the cardinality of sets of infinite trees recognizable by finite automata.- Extending temporal logic by explicit concurrency.- An extensional partial combinatory algebra based on ?-terms.- Once more on order-sorted algebras.- Composition of two semi commutations.- An efficient decision algorithm for the uniform semi-unification problem extended abstract.- Different modifications of pointer machines and their computational power.


Best Sellers


Product Details
  • ISBN-13: 9783540543459
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 233 mm
  • No of Pages: 437
  • Returnable: Y
  • Sub Title: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings
  • ISBN-10: 3540543457
  • Publisher Date: 07 Aug 1991
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 520 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings(520 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings(520 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings(520 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!