Proceedings of the Ninth International Conference on Implementation and Application of Automata
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Oscar H. Ibarra, Zhe Dang
Proceedings of the Ninth International Conference on Implementation and Application of Automata
CIAA, 2003.

FLT
DBLP
Scholar
Full names Links ISxN
@proceedings{CIAA-2003,
	address       = "Santa Barbara, California, USA",
	editor        = "Oscar H. Ibarra and Zhe Dang",
	isbn          = "3-540-40561-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Ninth International Conference on Implementation and Application of Automata}",
	volume        = 2759,
	year          = 2003,
}

Contents (33 items)

CIAA-2003-Henzinger #automaton #component #interface #specification
Automata for Specifying Component Interfaces (TAH), pp. 1–2.
CIAA-2003-Karhumaki #automaton #word
Automata on Words (JK), pp. 3–10.
CIAA-2003-WallmeierHT #finite #specification #synthesis
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications (NW, PH, WT), pp. 11–22.
CIAA-2003-WangY #parametricity #realtime
Timing Parameter Characterization of Real-Time Systems (FW, HCY), pp. 23–34.
CIAA-2003-Fritz #automaton #linear #logic #simulation #using
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata (CF), pp. 35–48.
CIAA-2003-ChamparnaudLOZ #automaton #finite
From Regular Weighted Expressions to Finite Automata (JMC, ÉL, FO, DZ), pp. 49–60.
CIAA-2003-TammU #automaton #regular expression
Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.
CIAA-2003-Zijl #regular expression
Succinct Descriptions of Regular Languages with Binary +-NFAs (LvZ), pp. 72–82.
CIAA-2003-AllauzenM #algorithm #performance
An Efficient Pre-determinization Algorithm (CA, MM), pp. 83–95.
CIAA-2003-LombardyPRS
Introducing VAUCANSON (SL, RP, YRG, JS), pp. 96–107.
CIAA-2003-KempeBGGN #compilation #finite #named
WFSC — A New Weighted Finite State Compiler (AK, CB, TG, FG, FN), pp. 108–119.
CIAA-2003-MiyamotoITS #graph #word
Ternary Directed Acyclic Word Graphs (SM, SI, MT, AS), pp. 120–130.
CIAA-2003-GuingneKN #automaton #complexity
Running Time Complexity of Printing an Acyclic Automaton (FG, AK, FN), pp. 131–140.
CIAA-2003-Trakhtman #complexity #testing
Reducing the Time Complexity of Testing for Local Threshold Testability (AT), pp. 141–149.
CIAA-2003-KuskeM #automaton #branch #parallel
Branching Automata with Costs — A Way of Reflecting Parallelism in Costs (DK, IM), pp. 150–162.
CIAA-2003-XieLD #complexity #equation #linear #problem #using
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.
CIAA-2003-WangHY #analysis
TCTL Inevitability Analysis of Dense-Time Systems (FW, GDH, FY), pp. 176–187.
CIAA-2003-FuBS #protocol #specification #verification
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services (XF, TB, JS), pp. 188–200.
CIAA-2003-HosoyaM #constraints
Boolean Operations for Attribute-Element Constraints (HH, MM), pp. 201–212.
CIAA-2003-TozawaH #xml
XML Schema Containment Checking Based on Semi-implicit Techniques (AT, MH), pp. 213–225.
CIAA-2003-Ravikumar #algorithm #automaton
Weak Minimization of DFA — An Algorithm and Applications (BR), pp. 226–238.
CIAA-2003-DaleyEM #automaton #probability #retrieval
Bag Automata and Stochastic Retrieval of Biomolecules in Solution (MD, MGE, IM), pp. 239–250.
CIAA-2003-FanLLTWY #algorithm
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract (THF, SL, HIL, TST, TCW, AY), pp. 251–257.
CIAA-2003-FerroDFL #programming #robust #semiparsing #using
Robust Parsing Using Dynamic Programming (MVF, VMD, JVF, LRL), pp. 258–268.
CIAA-2003-Castano #lr #parsing
LR Parsing for Global Index Languages (GILs) (JMC), pp. 269–281.
CIAA-2003-Sutner #sequence
The Ehrenfeucht-Mycielski Sequence (KS), pp. 282–293.
CIAA-2003-MelicharP #approach #automaton #finite #problem #sequence
The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.
CIAA-2003-PrestonK #automaton #named #visualisation
AVA: An Applet for Visualizing FRACTRAN and Other Automata (NP, MSK), pp. 297–298.
CIAA-2003-NgassamWK #automaton #finite
Preliminary Experiments in Hardcoding Finite Automata (EKN, BWW, DGK), pp. 299–300.
CIAA-2003-KellyC #finite #state machine
Computational Linguistic Motivations for a Finite-State Machine Hierarchy (RK, JCB), pp. 301–303.
CIAA-2003-FrishertCW #automaton #regular expression
The Effect of Rewriting Regular Expressions on Their Accepting Automata (MF, LGC, BWW), pp. 304–305.
CIAA-2003-BravoN #parsing
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language (CB, JJN), pp. 306–308.
CIAA-2003-UnoldTDT #finite
Finite-State Molecular Computing (OU, MT, TD, AT), pp. 309–310.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.