Fundamentals of Computation Theory
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Fundamentals of Computation Theory: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings
Fundamentals of Computation Theory: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings

Fundamentals of Computation Theory: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

This book constitutes the refereed proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT '99, held in Iasi, Romania in August/September 1999. The 42 revised full papers presented together with four invited papers were carefully selected from a total of 102 submissions. Among the topics addressed are abstract data types, algorithms and data structures, automata and formal languages, categorical and topological approaches, complexity, computational geometry, concurrency, cryptology, distributed computing, logics in computer science, process algebras, symbolic computation, molecular computing, quantum computing, etc.

Table of Contents:
Randomized complexity of linear arrangements and polyhedra?.- Tile transition systems as structured coalgebras?.- Caesar and DNA — views on cryptology.- Automata and their interaction: Definitional suggestions.- Axiomatising asynchronous process calculi.- A polynomial time approximation scheme for dense MupIN 2S{upAT}.- Decidable classes of the verification problem in a timed predicate logic.- Interpretations of extensible objects and types.- Restrictive acceptance suffices for equivalence problems.- Grammar systems as language analyzers and recursively enumerable languages.- An interpretation of extensible objects.- Modeling operating systems schedulers with multi-stack-queue grammars.- Iterative arrays with a wee bit alternation.- Secret sharing schemes with detection of cheaters for a general access structure.- Constructive notes on uniform and locally convex spaces.- Graph automorphisms with maximal projection distances.- Kleene theorems for event-clock automata.- Strong iteration lemmata for regular, linear, context-free, and linear indexed languages.- Exponential output size of top-down tree transducers.- On recognizable languages in divisibility monoids.- Expressiveness of point-to-point versus broadcast communications.- On relative loss bounds in generalized linear regression.- Generalized P-systems.- Optimal, distributed decision-making: The case of no communication.- Generalized PCP is decidable for marked morphisms.- On time-constructible functions in one-dimensional cellular automata.- Dichotomy theorem for the generalized unique satisfiability problem.- A general categorical connection between local event structures and local traces.- Correct translation of mutually recursive function systems into TOL collage grammars.- Synchronized product of linearbounded machines.- On maximal repetitions in words.- Axiomatization of the coherence property for categories of symmetries.- Sewing grammars.- State and transition complexity of Watson-Crick finite automata.- A confluence result for a typed ?-calculus of exception handling with fixed-point.- ?-Uniformly decidable sets and turing machines.- A parallel context-free derivation hierarchy.- Generalized synchronization languages.- A generalization of Dijkstra’s calculus to typed program specifications.- Homomorphisms and concurrent term rewriting.- On two-sided infinite fixed points of morphisms.- Tiling multi-dimensional arrays.- Modeling interaction by sheaves and geometric logic.- The operators minCh and maxCh on the polynomial hierarchy.- The Kolmogorov complexity of real numbers.- A partial order method for the verification of time Petri nets.- Deriving formulas for domination numbers of fasciagraphs and rotagraphs.


Best Sellers


Product Details
  • ISBN-13: 9783540664123
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 576
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3540664122
  • Publisher Date: 18 Aug 1999
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Fundamentals of Computation Theory: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Fundamentals of Computation Theory: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings
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.

Fundamentals of Computation Theory: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings

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

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!