Oscar H. Ibarra, Bala Ravikumar
Proceedings of the 13th International Conference on Implementation and Application of Automata
CIAA, 2008.

@proceedings{CIAA-2008,
	address       = "San Francisco, California, USA",
	editor        = "Oscar H. Ibarra and Bala Ravikumar",
	isbn          = "978-3-540-70843-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 13th International Conference on Implementation and Application of Automata}",
	volume        = 5148,
	year          = 2008,
}

Contents (30 items)

10 ×#automaton
5 ×#finite
4 ×#nondeterminism
3 ×#transducer
2 ×#complexity
2 ×#composition
2 ×#pattern matching
2 ×#regular expression
2 ×#testing

CIAA-2008-HolzerK #complexity #finite #nondeterminism

Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 1–16.

CIAA-2008-Salomaa

Language Decompositions, Primality, and Trajectory-Based Operations (KS), pp. 17–22.

CIAA-2008-Yannakakis #automaton #probability #recursion

Automata, Probability, and Recursion (MY), pp. 23–32.

CIAA-2008-Yen #concurrent #petri net

Concurrency, Synchronization, and Conflicts in Petri Nets (HCY), pp. 33–35.

CIAA-2008-TsayW #automation #composition #reasoning

Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 36–45.

CIAA-2008-AlmeidaMR #revisited #term rewriting

Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 46–56.

CIAA-2008-BouajjaniHHTV #automaton #finite #nondeterminism #testing

Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.

CIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing

Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.

CIAA-2008-PaunPR #question

Hopcroft’s Minimization Technique: Queues or Stacks? (AP, MP, ARP), pp. 78–91.

CIAA-2008-GarciaPAR #automaton #finite #learning #nondeterminism #regular expression #using

Learning Regular Languages Using Nondeterministic Finite Automata (PG, MVdP, GIA, JR), pp. 92–101.

CIAA-2008-InabaHM #metaprogramming #multi #transducer

Multi-Return Macro Tree Transducers (KI, HH, SM), pp. 102–111.

CIAA-2008-CantinLW #automaton

Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 112–121.

CIAA-2008-NishiyamaM #html

A Translation from the HTML DTD into a Regular Hedge Grammar (TN, YM), pp. 122–131.

CIAA-2008-Maletti

Tree-Series-to-Tree-Series Transformations (AM), pp. 132–140.

CIAA-2008-DixonES #analysis

Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning (RD, ÖE, TS), pp. 141–150.

CIAA-2008-LahodaMZ #pattern matching

Pattern Matching in DCA Coded Text (JL, BM, JZ), pp. 151–160.

CIAA-2008-GlabbeekP #algorithm #nondeterminism

Five Determinisation Algorithms (RJvG, BP), pp. 161–170.

CIAA-2008-HempelK #persistent #turing machine

Persistent Computations of Turing Machines (HH, MK), pp. 171–180.

CIAA-2008-DolzhenkoJ #2d #complexity #on the #transducer

On Complexity of Two Dimensional Languages Generated by Transducers (ED, NJ), pp. 181–190.

CIAA-2008-EsikI #game studies #logic

Games for Temporal Logics on Trees (ZÉ, SI), pp. 191–200.

CIAA-2008-MatsumotoHT #automaton #implementation #pattern matching #performance #runtime

A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 201–211.

CIAA-2008-AbdullaBHKV #automaton #bisimulation

Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.

CIAA-2008-Badr

Hyper-Minimization in O(n2) (AB), pp. 223–231.

CIAA-2008-Pighizzini #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.

CIAA-2008-Razet #finite

Finite Eilenberg Machines (BR), pp. 242–251.

CIAA-2008-BaturoPR #word

The Number of Runs in Sturmian Words (PB, MP, WR), pp. 252–261.

CIAA-2008-AllauzenM #composition #finite #transducer

3-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 262–273.

CIAA-2008-El-FakihY #automaton #equation

Progressive Solutions to FSM Equations (KEF, NY), pp. 274–282.

CIAA-2008-Fujiyoshi #automaton #context-free grammar

Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.

CIAA-2008-SimunekM #approximate #distance

Approximate Periods with Levenshtein Distance (MS, BM), pp. 286–287.