Jan Holub, Jan Zdárek
Revised Selected Papers of the 12th International Conference on Implementation and Application of Automata
CIAA, 2007.

@proceedings{CIAA-2007,
	address       = "Prague, Czech Republic",
	editor        = "Jan Holub and Jan Zdárek",
	isbn          = "978-3-540-76335-2",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the 12th International Conference on Implementation and Application of Automata}",
	volume        = 4783,
	year          = 2007,
}

Contents (34 items)

15 ×#automaton
4 ×#finite
4 ×#transducer
3 ×#context-free grammar
3 ×#performance
2 ×#2d
2 ×#library
2 ×#nondeterminism
2 ×#on the
2 ×#string

CIAA-2007-Paun #transducer

Spiking Neural P Systems Used as Acceptors and Transducers (GP), pp. 1–4.

CIAA-2007-Vardi #automaton #linear #model checking

Linear-Time Model Checking: Automata Theory in Practice (MYV), pp. 5–10.

CIAA-2007-AllauzenRSSM #finite #library #named #performance #transducer

OpenFst: A General and Efficient Weighted Finite-State Transducer Library (CA, MR, JS, WS, MM), pp. 11–23.

CIAA-2007-Watson #automaton

Automata Applications in Chip-Design Software (BWW), pp. 24–26.

CIAA-2007-Volkov #automaton #partial order

Synchronizing Automata Preserving a Chain of Partial Orders (MVV), pp. 27–37.

CIAA-2007-ChamparnaudGF #transducer

Reducing Acyclic Cover Transducers (JMC, FG, JF), pp. 38–50.

CIAA-2007-KleinB #automaton #on the fly

On-the-Fly Stuttering in the Construction of Deterministic ω-Automata (JK, CB), pp. 51–61.

CIAA-2007-GoldwurmR #modelling #statistics

Average Value and Variance of Pattern Statistics in Rational Models (MG, RR), pp. 62–72.

CIAA-2007-DrosteR #automaton #logic

Weighted Automata and Weighted Logics with Discounting (MD, GR), pp. 73–84.

CIAA-2007-KutribMW #automaton #nondeterminism

Regulated Nondeterminism in Pushdown Automata (MK, AM, LW), pp. 85–96.

CIAA-2007-SalomaaYZ

Deterministic Caterpillar Expressions (KS, SY, JZ), pp. 97–108.

CIAA-2007-HogbergMM #automaton #bisimulation

Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.

CIAA-2007-CarrascoDF #automaton #implementation

An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.

CIAA-2007-KleinB07a

Accelerating Boyer Moore Searches on Binary Texts (STK, MBN), pp. 130–143.

CIAA-2007-CrochemoreEGM #automaton #on the

On the Suffix Automaton with Mismatches (MC, CE, AG, FM), pp. 144–156.

CIAA-2007-PeltolaT #on the #string

On String Matching in Chunked Texts (HP, JT), pp. 157–167.

CIAA-2007-MohriMW #automaton

Factor Automata of Automata and Applications (MM, PJM, EW), pp. 168–179.

CIAA-2007-KucherovNR #automaton #set

Subset Seed Automaton (GK, LN, MAR), pp. 180–191.

CIAA-2007-MrazPO #context-free grammar #nondeterminism

A Measure for the Degree of Nondeterminism of Context-Free Languages (FM, MP, FO), pp. 192–202.

CIAA-2007-CaucalCFR #context-free grammar #performance #throughput

Efficient Computation of Throughput Values of Context-Free Languages (DC, JC, WF, WR), pp. 203–213.

CIAA-2007-BrabrandGM #ambiguity #context-free grammar

Analyzing Ambiguity of Context-Free Grammars (CB, RG, AM), pp. 214–225.

CIAA-2007-AckermanS #performance #regular expression

Efficient Enumeration of Regular Languages (MA, JS), pp. 226–242.

CIAA-2007-Barthelemy #multi

Multi-grain Relations (FB), pp. 243–252.

CIAA-2007-HoltmannL #game studies #infinity #memory management #reduction

Memory Reduction for Strategies in Infinite Games (MH, CL), pp. 253–264.

CIAA-2007-SteinbyT #morphism

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms (MS, CIT), pp. 265–276.

CIAA-2007-JonoskaP #2d #automaton #finite #representation

Finite State Automata Representing Two-Dimensional Subshifts (NJ, JBP), pp. 277–289.

CIAA-2007-AnselmoGM #2d #automaton

Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (MA, DG, MM), pp. 290–302.

CIAA-2007-BassinoDN #automaton #library

: A Library to Randomly and Exhaustively Generate Automata (FB, JD, CN), pp. 303–305.

CIAA-2007-BlancCW #finite

A Finite-State Super-Chunker (OB, MC, PW), pp. 306–308.

CIAA-2007-IliopoulosRVV #problem #sequence #string

The Constrained Longest Common Subsequence Problem for Degenerate Strings (CSI, MSR, MV, LV), pp. 309–311.

CIAA-2007-Klunder #automaton #finite

Finite Automata Accepting Star-Connected Languages (BK), pp. 312–313.

CIAA-2007-Marschner #transducer #using

Efficiently Matching with Local Grammars Using Prefix Overlay Transducers (CM), pp. 314–316.

CIAA-2007-Supol

Significant Subpatterns Matching (JS), pp. 317–319.

CIAA-2007-Yli-JyraK #compilation #parallel

A New Method for Compiling Parallel Replacement Rules (AYJ, KK), pp. 320–321.