Revised Selected Papers 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

Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu
Revised Selected Papers of the Ninth International Conference on Implementation and Application of Automata
CIAA, 2004.

FLT
DBLP
Scholar
Full names Links ISxN
@proceedings{CIAA-2004,
	address       = "Kingston, Canada",
	editor        = "Michael Domaratzki and Alexander Okhotin and Kai Salomaa and Sheng Yu",
	isbn          = "3-540-24318-6",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the Ninth International Conference on Implementation and Application of Automata}",
	volume        = 3317,
	year          = 2004,
}

Contents (41 items)

CIAA-2004-Ibarra #infinity
Automata-Theoretic Techniques for Analyzing Infinite-State Systems (OHI), p. 1.
CIAA-2004-LeeS #regular expression
Enumerating Regular Expressions and Their Languages (JL, JS), pp. 2–22.
CIAA-2004-AllauzenMR #library
A General Weighted Grammar Library (CA, MM, BR), pp. 23–34.
CIAA-2004-BerstelC #algorithm #complexity #on the
On the Complexity of Hopcroft’s State Minimization Algorithm (JB, OC), pp. 35–44.
CIAA-2004-BinderFLO #implementation
Implementation of Catalytic P Systems (AB, RF, GL, MO), pp. 45–56.
CIAA-2004-Borchardt #transducer
Code Selection by Tree Series Transducers (BB), pp. 57–67.
CIAA-2004-BordihnHK #context-free grammar #linear #problem
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.
CIAA-2004-ChamparnaudCP
Brute Force Determinization of NFAs by Means of State Covers (JMC, FC, TP), pp. 80–89.
CIAA-2004-ChamparnaudNZ #automaton
Computing the Follow Automaton of an Expression (JMC, FN, DZ), pp. 90–101.
CIAA-2004-DaleyM #complexity #verification
Viral Gene Compression: Complexity and Verification (MD, IM), pp. 102–112.
CIAA-2004-DebskiF #state machine
Concatenation State Machines and Simple Functions (WD, WF), pp. 113–124.
CIAA-2004-FrishertCW #automaton #finite #regular expression
FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views (MF, LGC, BWW), pp. 125–133.
CIAA-2004-GeserHWZ #automaton #finite #string #termination
Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
CIAA-2004-GiraudL #automaton #encoding #finite #linear
Linear Encoding Scheme for Weighted Finite Automata (MG, DL), pp. 146–155.
CIAA-2004-HanW #automaton
The Generalization of Generalized Automata: Expression Automata (YSH, DW), pp. 156–166.
CIAA-2004-HanMZ #approach #automaton #database #sequence
An Automata Approach to Match Gapped Sequence Tags Against Protein Database (YH, BM, KZ), pp. 167–177.
CIAA-2004-JirasekJS #complexity #regular expression
State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
CIAA-2004-John #ambiguity
Minimal Unambiguous eNFA (SJ), pp. 190–201.
CIAA-2004-KariKS
Substitutions, Trajectories and Noisy Channels (LK, SK, PS), pp. 202–212.
CIAA-2004-KrawetzLS #complexity #finite #monad #set
State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
CIAA-2004-NishimuraY #automaton #finite #interactive #proving #quantum
An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.
CIAA-2004-PengT #algorithm #performance #sequence
Time and Space Efficient Algorithms for Constrained Sequence Alignment (ZSP, HFT), pp. 237–246.
CIAA-2004-Shan #graph grammar #modelling #probability
Stochastic Context-Free Graph Grammars for Glycoprotein Modelling (BS), pp. 247–258.
CIAA-2004-Tischler #automaton #finite #parametricity
Parametric Weighted Finite Automata for Figure Drawing (GT), pp. 259–268.
CIAA-2004-FerroOG #fault #finite
Regional Finite-State Error Repair (MVF, JO, JGG), pp. 269–280.
CIAA-2004-Yli-Jyra #approximate #dependence #regular expression
Approximating Dependency Grammars Through Intersection of Regular Languages (AYJ), pp. 281–292.
CIAA-2004-ZakharovZ #automaton #multi #on the #problem #source code
On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.
CIAA-2004-CampeanuP #automaton #bound #nondeterminism
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.
CIAA-2004-Cojocaru #assembly #process #simulation
Simulating the Process of Gene Assembly in Ciliates (LC), pp. 308–309.
CIAA-2004-Couvreur #automaton #implementation
A BDD-Like Implementation of an Automata Package (JMC), pp. 310–311.
CIAA-2004-DelgadoM #approximate #regular expression
Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
CIAA-2004-Egri-NagyN #algebra #automaton #comparison #composition #finite #implementation
Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory (AEN, CLN), pp. 315–316.
CIAA-2004-EramianD #complexity #question
Does Hausdorff Dimension Measure Texture Complexity? (MGE, MD), pp. 317–318.
CIAA-2004-FrishertW #automaton #regular expression
Combining Regular Expressions with (Near-)Optimal Brzozowski Automata (MF, BWW), pp. 319–320.
CIAA-2004-Lugiez #automaton #linear #logic #set
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.
CIAA-2004-Maletti #theorem #transducer
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids (AM), pp. 323–324.
CIAA-2004-Polak #automaton #nondeterminism #using
Minimalizations of NFA Using the Universal Automaton (LP), pp. 325–326.
CIAA-2004-PolcarM #2d #automaton #online #pattern matching
Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata (TP, BM), pp. 327–328.
CIAA-2004-TammNU #automaton #multi #reduction
Size Reduction of Multitape Automata (HT, MN, EU), pp. 329–330.
CIAA-2004-XieLD #automaton #testing
Testability of Oracle Automata (GX, CL, ZD), pp. 331–332.
CIAA-2004-Zijl #difference #symmetry
Magic Numbers for Symmetric Difference NFAs (LvZ), pp. 333–334.

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.