Implementation and Application of Automata: 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings

Overview

Automata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. In addition, there is a growing number of software systems designed to manipulate automata, regular expressions, grammars, and related structures.

This volume contains 24 regular papers from the 8th International Conference on Implementation and Application of Automata (CIAA 2003) held in Santa Barbara, CA, USA, in July 2003 ...

See more details below
Available through our Marketplace sellers.
Other sellers (Paperback)
  • All (5) from $71.37   
  • New (2) from $79.69   
  • Used (3) from $71.37   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$79.69
Seller since 2011

Feedback rating:

(871)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Brand new and unread! Join our growing list of satisfied customers!

Ships from: Phoenix, MD

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$79.70
Seller since 2007

Feedback rating:

(23379)

Condition: New
BRAND NEW

Ships from: Avenel, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by
Sending request ...

Overview

Automata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. In addition, there is a growing number of software systems designed to manipulate automata, regular expressions, grammars, and related structures.

This volume contains 24 regular papers from the 8th International Conference on Implementation and Application of Automata (CIAA 2003) held in Santa Barbara, CA, USA, in July 2003 covering various topics in the theory, implementation, and application of automata and related structures. It also includes the abstracts of two invited lectures as well as the abstracts of the poster papers displayed during the conference.

Read More Show Less

Product Details

  • ISBN-13: 9783540405610
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 8/13/2003
  • Series: Lecture Notes in Computer Science Series , #2759
  • Edition description: 2003
  • Edition number: 1
  • Pages: 312
  • Product dimensions: 6.10 (w) x 9.30 (h) x 0.80 (d)

Table of Contents

Automata for Specifying Component Interfaces 1
Automata on Words 3
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications 11
Timing Parameter Characterization of Real-Time Systems 23
Constructing Buchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Buchi Automata 35
From Regular Weighted Expressions to Finite Automata 49
Bideterministic Automata and Minimal Representations of Regular Languages 61
Succinct Descriptions of Regular Languages with Binary [actual symbol not reproducible]-NFAs 72
An Efficient Pre-determinization Algorithm 83
Introducing Vaucanson 96
WFSC - A New Weighted Finite State Compiler 108
Ternary Directed Acyclic Word Graphs 120
Running Time Complexity of Printing an Acyclic Automaton 131
Reducing the Time Complexity of Testing for Local Threshold Testability 141
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs 150
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations 163
TCTL Inevitability Analysis of Dense-Time Systems 176
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services 188
Boolean Operations for Attribute-Element Constraints 201
XML Schema Containment Checking Based on Semi-implicit Techniques 213
Weak Minimization of DFA - An Algorithm and Applications 226
Bag Automata and Stochastic Retrieval of Biomolecules in Solution 239
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract 251
Robust Parsing Using Dynamic Programming 258
LR Parsing for Global Index Languages (GILs) 269
The Ehrenfeucht-Mycielski Sequence 282
The Longest Common Subsequence Problem - A Finite Automata Approach 294
AVA: An Applet for Visualizing FRACTRAN and Other Automata 297
Preliminary Experiments in Hardcoding Finite Automata 299
Computational Linguistic Motivations for a Finite-State Machine Hierarchy 301
The Effect of Rewriting Regular Expressions on Their Accepting Automata 304
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language 306
Finite-State Molecular Computing 309
Author Index 311
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)