Nelma Moreira, Rogério Reis
Proceedings of the 17th International Conference on Implementation and Application of Automata
CIAA, 2012.

@proceedings{CIAA-2012,
	address       = "Porto, Portugal",
	doi           = "10.1007/978-3-642-31606-7",
	editor        = "Nelma Moreira and Rogério Reis",
	isbn          = "978-3-642-31605-0",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 17th International Conference on Implementation and Application of Automata}",
	volume        = 7381,
	year          = 2012,
}

Contents (33 items)

18 ×#automaton
3 ×#bound
3 ×#on the
2 ×#algorithm
2 ×#ambiguity
2 ×#complexity
2 ×#multi
2 ×#regular expression
2 ×#transducer
2 ×#word

CIAA-2012-GaoS

In Memoriam Sheng Yu (YG, KS), pp. 1–4.

CIAA-2012-Brzozowski #regular expression

In Search of Most Complex Regular Languages (JAB), pp. 5–24.

CIAA-2012-EhrenfeuchtR #framework #process

A Formal Framework for Processes Inspired by the Functioning of Living Cells (AE, GR), pp. 25–27.

CIAA-2012-GastinM #automaton

Adding Pebbles to Weighted Automata (PG, BM), pp. 28–51.

CIAA-2012-Oliveira #algebra #automaton #linear #probability

Typed Linear Algebra for Weigthed (Probabilistic) Automata (JNO), pp. 52–65.

CIAA-2012-AllauzenR #automaton #library #transducer

A Pushdown Transducer Extension for the OpenFst Library (CA, MR), pp. 66–77.

CIAA-2012-AmaviCR #recursion #xml

Weak Inclusion for Recursive XML Types (JA, JC, PR), pp. 78–89.

CIAA-2012-Berlinkov #automaton

Synchronizing Automata on Quasi-Eulerian Digraph (MVB), pp. 90–100.

CIAA-2012-Ceccherini-SilbersteinCFS #automaton

Cellular Automata on Regular Rooted Trees (TCS, MC, FF, ZS), pp. 101–112.

CIAA-2012-Crespi-ReghizziP #strict #testing

Strict Local Testability with Consensus Equals Regularity (SCR, PSP), pp. 113–124.

CIAA-2012-DeganoFM #automaton #resource management

Nominal Automata for Resource Usage Control (PD, GLF, GM), pp. 125–137.

CIAA-2012-DrosteP #automaton #logic #word

Weighted Nested Word Automata and Logics over Strong Bimonoids (MD, BP), pp. 138–148.

CIAA-2012-FaroL #algorithm #automaton #online #performance #string

A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.

CIAA-2012-FominykhV

P(l)aying for Synchronization (FMF, MVV), pp. 159–170.

CIAA-2012-Gusev #automaton #bound #rank

Synchronizing Automata of Bounded Rank (VVG), pp. 171–179.

CIAA-2012-GocHS #automation #combinator #word

Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 180–191.

CIAA-2012-IbarraT #automaton #how #multi

How to Synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 192–204.

CIAA-2012-JahnKL

Regular Ideal Languages and Their Boolean Combinations (FJ, MK, AL), pp. 205–216.

CIAA-2012-JezM #automaton

Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.

CIAA-2012-JiraskovaM #complexity #on the

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.

CIAA-2012-KlimannMP #automaton #implementation

Implementing Computations in Automaton (Semi)groups (IK, JM, MP), pp. 240–252.

CIAA-2012-KutribO #automaton #complexity #on the

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.

CIAA-2012-Mohri #algorithm #ambiguity #automaton #finite #functional #transducer

A Disambiguation Algorithm for Finite Automata and Functional Transducers (MM), pp. 265–277.

CIAA-2012-Martyugin #ambiguity #automaton

Synchronization of Automata with One Undefined or Ambiguous Transition (PVM), pp. 278–288.

CIAA-2012-PrusaM #automaton

Restarting Tiling Automata (DP, FM), pp. 289–300.

CIAA-2012-ReussS

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses (AR, HS), pp. 301–312.

CIAA-2012-AmarniL #kernel #sequence

Factor and Subsequence Kernels and Signatures of Rational Languages (AA, SL), pp. 313–320.

CIAA-2012-CaronCM #multi

Multi-Tilde-Bar Derivatives (PC, JMC, LM), pp. 321–328.

CIAA-2012-HeamHK #bound #constraints #on the

On Positive TAGED with a Bounded Number of Constraints (PCH, VH, OK), pp. 329–336.

CIAA-2012-LiuSGF #automaton #named #regular expression

SDFA: Series DFA for Memory-Efficient Regular Expression Matching (TL, YS, LG, BF), pp. 337–344.

CIAA-2012-LombardyS

The Removal of Weighted ε-Transitions (SL, JS), pp. 345–352.

CIAA-2012-Mandrali #ltl

Weighted LTL with Discounting (EM), pp. 353–360.

CIAA-2012-ReidenbachS #automaton #bound #nondeterminism

Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.