Implementation and Application of Automata: 8th International Conference, Ciaa 2003, Santa Barbara, Ca, Usa, July 16-18, 2003 : Proceedings
by Ciaa 2003 (2003 Santa Barbara, Calif.); Ibarra, Oscar H.; Danga, Zhe; Dang, ZheFormat: Paperback
Pub. Date: 2003-08-01
Publisher(s): Springer-Verlag New York Inc
Other versions by this Author
List Price: $117.77
Rent Textbook
Select for Price
Rent Digital
$42.90*
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
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.
Table of Contents
| Automata for Specifying Component Interfaces | p. 1 |
| Automata on Words | p. 3 |
| Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications | p. 11 |
| Timing Parameter Characterization of Real-Time Systems | p. 23 |
| Constructing Buchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Buchi Automata | p. 35 |
| From Regular Weighted Expressions to Finite Automata | p. 49 |
| Bideterministic Automata and Minimal Representations of Regular Languages | p. 61 |
| Succinct Descriptions of Regular Languages with Binary [actual symbol not reproducible]-NFAs | p. 72 |
| An Efficient Pre-determinization Algorithm | p. 83 |
| Introducing Vaucanson | p. 96 |
| WFSC - A New Weighted Finite State Compiler | p. 108 |
| Ternary Directed Acyclic Word Graphs | p. 120 |
| Running Time Complexity of Printing an Acyclic Automaton | p. 131 |
| Reducing the Time Complexity of Testing for Local Threshold Testability | p. 141 |
| Branching Automata with Costs - A Way of Reflecting Parallelism in Costs | p. 150 |
| New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations | p. 163 |
| TCTL Inevitability Analysis of Dense-Time Systems | p. 176 |
| Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services | p. 188 |
| Boolean Operations for Attribute-Element Constraints | p. 201 |
| XML Schema Containment Checking Based on Semi-implicit Techniques | p. 213 |
| Weak Minimization of DFA - An Algorithm and Applications | p. 226 |
| Bag Automata and Stochastic Retrieval of Biomolecules in Solution | p. 239 |
| An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract | p. 251 |
| Robust Parsing Using Dynamic Programming | p. 258 |
| LR Parsing for Global Index Languages (GILs) | p. 269 |
| The Ehrenfeucht-Mycielski Sequence | p. 282 |
| The Longest Common Subsequence Problem - A Finite Automata Approach | p. 294 |
| AVA: An Applet for Visualizing FRACTRAN and Other Automata | p. 297 |
| Preliminary Experiments in Hardcoding Finite Automata | p. 299 |
| Computational Linguistic Motivations for a Finite-State Machine Hierarchy | p. 301 |
| The Effect of Rewriting Regular Expressions on Their Accepting Automata | p. 304 |
| Building Context-Sensitive Parsers from CF Grammars with Regular Control Language | p. 306 |
| Finite-State Molecular Computing | p. 309 |
| Author Index | p. 311 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.