Implementation and Application of Automata [electronic resource] : 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings / edited by Oscar H. Ibarra, Zhe Dang.
- 1st ed. 2003.
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2759
Lecture Notes in Computer Science, 0302-9743 ; 2759
1 online resource (XI, 312 pages)
- Artificial intelligence.
Logic, Symbolic and mathematical.
- Local subjects:
- Artificial Intelligence. (search)
Computation by Abstract Devices. (search)
Computer Science, general. (search)
Algorithm Analysis and Problem Complexity. (search)
Logics and Meanings of Programs. (search)
Mathematical Logic and Formal Languages. (search)
- System Details:
- text file PDF
- 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.
- Invited Lectures
Automata for Specifying Component Interfaces
Automata on Words
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
Timing Parameter Characterization of Real-Time Systems
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
From Regular Weighted Expressions to Finite Automata
Bideterministic Automata and Minimal Representations of Regular Languages
Succinct Descriptions of Regular Languages with Binary ?-NFAs
An Efficient Pre-determinization Algorithm
WFSC - A New Weighted Finite State Compiler
Ternary Directed Acyclic Word Graphs
Running Time Complexity of Printing an Acyclic Automaton
Reducing the Time Complexity of Testing for Local Threshold Testability
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
TCTL Inevitability Analysis of Dense-Time Systems
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
Boolean Operations for Attribute-Element Constraints
XML Schema Containment Checking Based on Semi-implicit Techniques
Weak Minimization of DFA - An Algorithm and Applications
Bag Automata and Stochastic Retrieval of Biomolecules in Solution
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
Robust Parsing Using Dynamic Programming
LR Parsing for Global Index Languages (GILs)
The Ehrenfeucht-Mycielski Sequence
The Longest Common Subsequence Problem A Finite Automata Approach
AVA: An Applet for Visualizing FRACTRAN and Other Automata
Preliminary Experiments in Hardcoding Finite Automata
Computational Linguistic Motivations for a Finite-State Machine Hierarchy
The Effect of Rewriting Regular Expressions on Their Accepting Automata
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language
Finite-State Molecular Computing.
- Ibarra, Oscar H. editor., Editor,
Dang, Zhe. editor., Editor,
SpringerLink (Online service)
- Contained In:
- Springer eBooks
- Other format:
- Printed edition:
- Publisher Number:
- 10.1007/3-540-45089-0 doi
- Access Restriction:
- Restricted for use by site license.
|Location||Notes||Your Loan Policy|
|Description||Status||Barcode||Your Loan Policy|