Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings(Theoretical Computer Science and General Issues)
36%
Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings(Theoretical Computer Science and General Issues)

Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings(Theoretical Computer Science and General Issues)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008. The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.

Table of Contents:
Invited Talks.- Iteration Semirings.- Various Aspects of Finite Quantum Automata.- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes.- Selected Ideas Used for Decidability and Undecidability of Bisimilarity.- The Frobenius Problem and Its Generalizations.- Well Quasi-orders in Formal Language Theory.- Contributed Papers.- On the Non-deterministic Communication Complexity of Regular Languages.- General Algorithms for Testing the Ambiguity of Finite Automata.- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.- The Average State Complexity of the Star of a Finite Set of Words Is Linear.- On the Computational Capacity of Parallel Communicating Finite Automata.- On a Generalization of Standard Episturmian Morphisms.- Universal Recursively Enumerable Sets of Strings.- Algorithmically Independent Sequences.- Relationally Periodic Sequences and Subword Complexity.- Bounds on Powers in Strings.- When Is Reachability Intrinsically Decidable?.- Some New Modes of Competence-Based Derivations in CD Grammar Systems.- The Synchronization Problem for Strongly Transitive Automata.- On the Decidability of the Equivalence for k-Valued Transducers.- Decidable Properties of 2D Cellular Automata.- Fixed Point and Aperiodic Tilings.- Extended Multi Bottom-Up Tree Transducers.- Derivation Tree Analysis for Accelerated Fixed-Point Computation.- Tree Automata with Global Constraints.- Bad News on Decision Problems for Patterns.- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.- More Concise Representation of Regular Languages by Automata and Regular Expressions.- A Taxonomy of Deterministic Forgetting Automata.- Provably Shorter Regular Expressions from Deterministic Finite Automata.- Large Simple Binary EqualityWords.- On the Relation between Periodicity and Unbordered Factors of Finite Words.- Duplication in DNA Sequences.- On the State Complexity of Complements, Stars, and Reversals of Regular Languages.- On the State Complexity of Operations on Two-Way Finite Automata.- On the Size Complexity of Rotating and Sweeping Automata.- An Analysis and a Reproof of Hmelevskii’s Theorem.- Hierarchies of Piecewise Testable Languages.- Construction of Tree Automata from Regular Expressions.- Balance Properties and Distribution of Squares in Circular Words.- MSO Logic for Unambiguous Shared-Memory Systems.- Complexity of Topological Properties of Regular ?-Languages.


Best Sellers


Product Details
  • ISBN-13: 9783540857792
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Edition: 2008 ed.
  • Language: English
  • Returnable: N
  • Series Title: 5257 Lecture Notes in Computer Science
  • Spine Width: 33 mm
  • Weight: 815 gr
  • ISBN-10: 3540857796
  • Publisher Date: 04 Sep 2008
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 544
  • Returnable: Y
  • Series Title: Theoretical Computer Science and General Issues
  • Sub Title: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings(Theoretical Computer Science and General Issues)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings(Theoretical Computer Science and General Issues)
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.

Developments in Language Theory: 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings(Theoretical Computer Science and General Issues)

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!
    ASK VIDYA