Skip to main content
SpringerLink
Log in

Implementation and Application of Automata

8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Oscar H. Ibarra

    1. Department of Computer Science, University of California, Santa Barbara, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Zhe Dang

    1. School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2759)

Included in the following conference series:

Conference proceedings info: CIAA 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Lectures

    1. Automata for Specifying Component Interfaces

      • Thomas A. Henzinger
      Pages 1-2

    2. Automata on Words

      • Juhani Karhumäki
      Pages 3-11

  3. Regular Papers

    1. Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications

      • Nico Wallmeier, Patrick Hütten, Wolfgang Thomas
      Pages 11-22

    2. Timing Parameter Characterization of Real-Time Systems

      • Farn Wang, Hsu-Chun Yen
      Pages 23-34

    3. Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

      • Carsten Fritz
      Pages 35-48

    4. From Regular Weighted Expressions to Finite Automata

      • Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi
      Pages 49-60

    5. Bideterministic Automata and Minimal Representations of Regular Languages

      • Hellis Tamm, Esko Ukkonen
      Pages 61-71

    6. Succinct Descriptions of Regular Languages with Binary ⊕-NFAs

      • Lynette van Zijl
      Pages 72-82

    7. An Efficient Pre-determinization Algorithm

      • Cyril Allauzen, Mehryar Mohri
      Pages 83-95

    8. Introducing Vaucanson

      • Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch
      Pages 96-107

    9. WFSC — A New Weighted Finite State Compiler

      • André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart
      Pages 108-119

    10. Ternary Directed Acyclic Word Graphs

      • Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
      Pages 120-130

    11. Running Time Complexity of Printing an Acyclic Automaton

      • Franck Guingne, André Kempe, Florent Nicart
      Pages 131-140

    12. Reducing the Time Complexity of Testing for Local Threshold Testability

      • Avraham Trakhtman
      Pages 141-149

    13. Branching Automata with Costs — A Way of Reflecting Parallelism in Costs

      • Dietrich Kuske, Ingmar Meinecke
      Pages 150-162

    14. New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations

      • Gaoyan Xie, Cheng Li, Zhe Dang
      Pages 163-175

    15. TCTL Inevitability Analysis of Dense-Time Systems

      • Farn Wang, Geng-Dian Hwang, Fang Yu
      Pages 176-186

    16. Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services

      • Xiang Fu, Tevfik Bultan, Jianwen Su
      Pages 188-200

    17. Boolean Operations for Attribute-Element Constraints

      • Haruo Hosoya, Makoto Murata
      Pages 201-212
Back to top

Other volumes

  1. Implementation and Application of Automata

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer Science, University of California, Santa Barbara, USA

    Oscar H. Ibarra

  • School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA

    Zhe Dang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation