default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th CIAA 2003: Santa Barbara, CA, USA
- Oscar H. Ibarra, Zhe Dang:
Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2759, Springer 2003, ISBN 3-540-40561-5
Invited Lectures
- Thomas A. Henzinger:
Automata for Specifying Component Interfaces. 1-2 - Juhani Karhumäki:
Automata on Words. 3-10
Regular Papers
- Nico Wallmeier, Patrick Hütten, Wolfgang Thomas:
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications. 11-22 - Farn Wang, Hsu-Chun Yen:
Timing Parameter Characterization of Real-Time Systems. 23-34 - Carsten Fritz:
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata. 35-48 - Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi:
From Regular Weighted Expressions to Finite Automata. 49-60 - Hellis Tamm, Esko Ukkonen:
Bideterministic Automata and Minimal Representations of Regular Languages. 61-71 - Lynette van Zijl:
Succinct Descriptions of Regular Languages with Binary +-NFAs. 72-82 - Cyril Allauzen, Mehryar Mohri:
An Efficient Pre-determinization Algorithm. 83-95 - Sylvain Lombardy, Raphael Poss
, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. 96-107 - André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart:
WFSC - A New Weighted Finite State Compiler. 108-119 - Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary Directed Acyclic Word Graphs. 120-130 - Franck Guingne, André Kempe, Florent Nicart:
Running Time Complexity of Printing an Acyclic Automaton. 131-140 - Avraham Trakhtman:
Reducing the Time Complexity of Testing for Local Threshold Testability. 141-149 - Dietrich Kuske, Ingmar Meinecke:
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. 150-162 - Gaoyan Xie, Cheng Li, Zhe Dang:
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations. 163-175 - Farn Wang, Geng-Dian Hwang, Fang Yu:
TCTL Inevitability Analysis of Dense-Time Systems. 176-187 - Xiang Fu, Tevfik Bultan, Jianwen Su:
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services. 188-200 - Haruo Hosoya, Makoto Murata:
Boolean Operations for Attribute-Element Constraints. 201-212 - Akihiko Tozawa, Masami Hagiya:
XML Schema Containment Checking Based on Semi-implicit Techniques. 213-225 - Bala Ravikumar:
Weak Minimization of DFA - An Algorithm and Applications. 226-238 - Mark Daley, Mark G. Eramian, Ian McQuillan:
Bag Automata and Stochastic Retrieval of Biomolecules in Solution. 239-250 - Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, Adam Yao:
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract. 251-257 - Manuel Vilares Ferro, Victor M. Darriba, Jesús Vilares Ferro, Leandro Rodríguez Liñares:
Robust Parsing Using Dynamic Programming. 258-268 - José M. Castaño:
LR Parsing for Global Index Languages (GILs). 269-281 - Klaus Sutner:
The Ehrenfeucht-Mycielski Sequence. 282-293
Poster Papers
- Borivoj Melichar, Tomás Polcar:
The Longest Common Subsequence Problem A Finite Automata Approach. 294-296 - Nathan Preston, Mukkai S. Krishnamoorthy:
AVA: An Applet for Visualizing FRACTRAN and Other Automata. 297-298 - Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie:
Preliminary Experiments in Hardcoding Finite Automata. 299-300 - Robert Kelly, Julie Carson-Berndsen:
Computational Linguistic Motivations for a Finite-State Machine Hierarchy. 301-303 - Michiel Frishert, Loek G. Cleophas, Bruce W. Watson:
The Effect of Rewriting Regular Expressions on Their Accepting Automata. 304-305 - César Bravo, João José Neto:
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language. 306-308 - Olgierd Unold, Maciej Troc, Tadeusz Dobosz, Alicja Trusewicz:
Finite-State Molecular Computing. 309-310
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-19 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
