Proceedings of the 11th 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, Hsu-Chun Yen
Proceedings of the 11th International Conference on Implementation and Application of Automata
CIAA, 2006.

FLT
DBLP
Scholar
Full names Links ISxN
@proceedings{CIAA-2006,
	address       = "Taipei, Taiwan",
	editor        = "Oscar H. Ibarra and Hsu-Chun Yen",
	isbn          = "3-540-37213-X",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 11th International Conference on Implementation and Application of Automata}",
	volume        = 4094,
	year          = 2006,
}

Contents (32 items)

CIAA-2006-Li #distance
Information Distance and Its Applications (ML0), pp. 1–9.
CIAA-2006-Rozenberg #assembly
Theory Inspired by Gene Assembly in Ciliates (GR), p. 10.
CIAA-2006-Yu #complexity #on the
On the State Complexity of Combined Operations (SY), pp. 11–22.
CIAA-2006-GiraudVL #automaton #finite
Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.
CIAA-2006-BordihnHK #automaton #finite #hybrid
Hybrid Extended Finite Automata (HB, MH, MK), pp. 34–45.
CIAA-2006-Tischler #automaton #finite #random #refinement #video
Refinement of Near Random Access Video Coding with Weighted Finite Automata (GT), pp. 46–57.
CIAA-2006-SimunekM #automaton #finite
Borders and Finite Automata (MS, BM), pp. 58–68.
CIAA-2006-AntoniouHIMP #automaton #finite #using
Finding Common Motifs with Gaps Using Finite Automata (PA, JH, CSI, BM, PP), pp. 69–77.
CIAA-2006-CrochemoreIS
Factor Oracles (MC, LI, ESH), pp. 78–89.
CIAA-2006-BastienCFR #exponential
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 90–101.
CIAA-2006-MayK #automaton #named #tool support
Tiburon: A Weighted Tree Automata Toolkit (JM, KK), pp. 102–113.
CIAA-2006-BacletP #algorithm
Around Hopcroft’s Algorithm (MB, CP), pp. 114–125.
CIAA-2006-NicartCCGK #automaton #multi
Multi-tape Automata with Symbol Classes (FN, JMC, TC, TG, AK), pp. 126–136.
CIAA-2006-CortesMR #automaton #on the #probability #standard
On the Computation of Some Standard Distances Between Probabilistic Automata (CC, MM, AR), pp. 137–149.
CIAA-2006-Maletti #question
Does o-Substitution Preserve Recognizability? (AM), pp. 150–161.
CIAA-2006-MesserschmidtMOP #complexity #correctness
Correctness Preservation and Complexity of Simple RL-Automata (HM, FM, FO, MP), pp. 162–172.
CIAA-2006-AbdullaKH #automaton #bisimulation
Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.
CIAA-2006-Glockler #automaton
Forgetting Automata and Unary Languages (JG), pp. 186–197.
CIAA-2006-Leung #ambiguity #automaton #finite
Structurally Unambiguous Finite Automata (HL), pp. 198–207.
CIAA-2006-BloemCPRS #automaton #implementation
Symbolic Implementation of Alternating Automata (RB, AC, IP, MR, SS), pp. 208–218.
CIAA-2006-ChengWC #analysis #bisimulation #branch #composition #on the fly
On-the-Fly Branching Bisimulation Minimization for Compositional Analysis (YPC, HYW, YRC), pp. 219–229.
CIAA-2006-Fernando #finite
Finite-State Temporal Projection (TF), pp. 230–241.
CIAA-2006-ConstantM #automaton #compilation #constraints #finite
Compiling Linguistic Constraints into Finite State Automata (MC, DM), pp. 242–252.
CIAA-2006-GalvezSF #bound #linear #lookahead #parsing
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
CIAA-2006-PargaGR #algorithm #product line #regular expression
A Family of Algorithms for Non Deterministic Regular Languages Inference (MVdP, PG, JR), pp. 265–274.
CIAA-2006-OnderB #proving
XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof (RO, ZB), pp. 275–276.
CIAA-2006-RoyC #finite #infinity #model checking
A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems (SR, BC), pp. 277–278.
CIAA-2006-YangXSP #hybrid #quantum #synthesis
Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits (GY, FX, XS, MAP), pp. 279–280.
CIAA-2006-Luttenberger #analysis #integer #reachability #source code
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic (ML), pp. 281–282.
CIAA-2006-BonfanteRP #ambiguity #automaton
Lexical Disambiguation with Polarities and Automata (GB, JLR, GP), pp. 283–284.
CIAA-2006-Thurston #automaton #parsing #regular expression
Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression (ADT), pp. 285–286.
CIAA-2006-Hyyro #approximate #automaton #nondeterminism #string
Tighter Packed Bit-Parallel NFA for Approximate String Matching (HH), pp. 287–289.

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.