| Title |
Authors |
|
Succinct Descriptions of Regular Languages with Binary Symmetric Difference NFAs
|
L. van Zijl |
|
Reducing the time complexity of testing of local threshold testability
|
A.N. Trahtman |
|
Bag automata and stochastic retrieval of biomolecules in solution |
Mark Daley, Mark Eramian, Ian McQuillan |
|
Branching automata with costs - a way of reflecting parallelism in costs
|
Dietrich Kuske, Ingmar Meinecke |
|
Introducing Vaucanson
|
Sylvain Lombardy, Raphael Poss, Yann Regis-Gianas, Jacques Sakarovitch
|
|
From regular weighted expressions to finite automata
|
J.-M Champarnaud, E. Laugerotte, F. Ouardi, D. Ziadi
|
|
WFSC - A New Weighted Finite State Compiler
|
Andre Kempe, Christof Baeijs, Tamas Gaal, Franck Guingne, Florent Nicart
|
|
An Efficient Pre-Determinization Algorithm
|
Cyril Allauzen, Mehryar Mohri
|
|
Timing Parameter Characterization of Real-Time Systems
|
Farn Wang, Hsu-Chun Yen
|
|
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear
Diophantine Equations
|
Gaoyan Xie, Cheng Li, Zhe Dang
|
|
Boolean Operations and Inclusion Test for Attribute-Element Constraints
|
Haruo Hosoya, Makoto Murata
|
|
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
|
Nico Wallmeier,
Patrick Huetten,
Wolfgang Thomas
|
|
Constructing Buchi Automata from Linear Temporal Logic Using Simulation Relations for
Alternating Buchi Automata
|
Carsten Fritz
|
|
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
|
Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, Adam Yao
|
|
Complexity of Printing an Acyclic Automaton
|
Franck Guingne,
Andre Kempe,
Florent Nicart
|
|
Robust parsing in dynamic programming
|
M. Vilares, V.M. Darriba, J. Vilares, L. Rodriguez
|
|
LR Parsing for Global Index Grammars
|
Jose M. Castano
|
|
Bideterministic automata and minimal representations of regular languages
|
Hellis Tamm, Esko Ukkonen
|
|
Weak Minimization of DFA - An algorithm and applications
|
B. Ravikumar
|
|
The Ehrenfeucht-Mycielski Sequence
|
Klaus Sutner
|
|
TCTL Inevitability Analysis of Dense-Time Systems
|
Farn Wang, Geng-Dian Hwang, Fang Yu
|
|
XML Schema Containment Checking based on Semi-implicit Techniques
|
Akihiko Tozawa, Masami Hagiya
|
|
Ternary Directed Acyclic Word Graphs
|
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
|
|
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic
Services
|
Xiang Fu, Tevfik Bultan, Jianwen Su
|
|
(Poster Paper)
The Longest Common Subsequence Problem A Finite Automata Approach
|
Borivoj Melichar, Tomas Polcar
|
|
(Poster Paper)
AVA: An Applet for Visualizing FRACTRAN and Other Automata
|
Nathan Preston, Mukkai S. Krishnamoorthy
|
|
(Poster Paper)
Hardcoding Finite State Automata Processing
|
E. Ketcha Ngassam, Bruce W Watson, Derrick G Kourie
|
|
(Poster Paper)
Computational Linguistic Motivations for a Finite-State Machine Hierarchy
|
Robert Kelly, Julie Carson-Berndsen
|
|
(Poster Paper)
The Effect of Rewriting Regular Expressions on Their Accepting Automata
|
Michiel Frishert, Bruce W. Watson
|
|
(Poster Paper)
Building Context-Sensitive parsers from Context-free grammars with regular control
language
|
Cesar Bravo and Joao Jose Neto
|
|
(Poster Paper)
Finite-State Molecular Computing
|
Olgierd Unold, Maciej Troc, Tadeusz Dobosz, Alicja Trusewicz
|