Adrian Horia Dediu, Armand-Mihai Ionescu, Carlos Martín-Vide
Proceedings of the Third International Conference on Language and Automata Theory and Applications
LATA, 2009.
@proceedings{LATA-2009, address = "Tarragona, Spain", doi = "10.1007/978-3-642-00982-2", editor = "Adrian Horia Dediu and Armand-Mihai Ionescu and Carlos Martín-Vide", isbn = "978-3-642-00981-5", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the Third International Conference on Language and Automata Theory and Applications}", volume = 5457, year = 2009, }
Contents (63 items)
- LATA-2009-BalbachZ #algorithm #education
- Recent Developments in Algorithmic Teaching (FJB, TZ), pp. 1–18.
- LATA-2009-Courcelle #algorithm #graph #higher-order #logic #monad
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
- LATA-2009-HolzerK #automaton #complexity #finite
- Descriptional and Computational Complexity of Finite Automata (MH, MK), pp. 23–42.
- LATA-2009-Jain #learning
- Hypothesis Spaces for Learning (SJ), pp. 43–58.
- LATA-2009-Salomaa #automaton #complexity #word
- State Complexity of Nested Word Automata (KS), pp. 59–70.
- LATA-2009-AbdullaDB #comparison #petri net
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (PAA, GD, LVB), pp. 71–82.
- LATA-2009-AfoninG #regular expression
- Minimal Union-Free Decompositions of Regular Languages (SA, DG), pp. 83–92.
- LATA-2009-Akama #commutative #learning
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (YA), pp. 93–104.
- LATA-2009-BaaderBT #policy
- Matching Trace Patterns with Regular Policies (FB, AB, AT), pp. 105–116.
- LATA-2009-BaillyD #convergence
- Absolute Convergence of Rational Series Is Semi-decidable (RB, FD), pp. 117–128.
- LATA-2009-BehleKR
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] (CB, AK, SR), pp. 129–140.
- LATA-2009-BergH #problem
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights (TB, HH), pp. 141–151.
- LATA-2009-BertrandPR #consistency #refinement #specification
- Refinement and Consistency of Timed Modal Specifications (NB, SP, JBR), pp. 152–163.
- LATA-2009-BeyersdorffKM #complexity #nondeterminism #proving
- Nondeterministic Instance Complexity and Proof Systems with Advice (OB, JK, SM), pp. 164–175.
- LATA-2009-Blanchet-SadriABM #how #question #word
- How Many Holes Can an Unbordered Partial Word Contain? (FBS, EA, CB, RM), pp. 176–187.
- LATA-2009-Blanchet-SadriMRW #algorithm #using #word
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (FBS, RM, AR, EW), pp. 188–199.
- LATA-2009-BoigelotD #automaton #finite #set #visualisation
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
- LATA-2009-Bollig #bound #complexity #integer #multi
- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (BB), pp. 212–223.
- LATA-2009-BonizzoniFMM
- Picture Languages Generated by Assembling Tiles (PB, CF, ARSM, GM), pp. 224–235.
- LATA-2009-BordihnHK #problem #subclass
- Undecidability of Operation Problems for T0L Languages and Subclasses (HB, MH, MK), pp. 236–246.
- LATA-2009-BrzozowskiSX #problem
- Decision Problems for Convex Languages (JAB, JS, ZX), pp. 247–258.
- LATA-2009-BucciL #image #on the #product line #word
- On a Family of Morphic Images of Arnoux-Rauzy Words (MB, ADL), pp. 259–266.
- LATA-2009-BuchseS #datalog #monad #transducer
- Monadic Datalog Tree Transducers (MB, TS), pp. 267–278.
- LATA-2009-CarleN #on the #regular expression
- On Extended Regular Expressions (BC, PN), pp. 279–289.
- LATA-2009-CaronCM #automaton #multi
- Multi-tilde Operators and Their Glushkov Automata (PC, JMC, LM), pp. 290–301.
- LATA-2009-CattaneoDFP #automaton
- Non-uniform Cellular Automata (GC, AD, EF, JP), pp. 302–313.
- LATA-2009-ClarridgeS #automaton #composition
- A Cryptosystem Based on the Composition of Reversible Cellular Automata (AC, KS), pp. 314–325.
- LATA-2009-DassowT #petri net
- Grammars Controlled by Special Petri Nets (JD, ST), pp. 326–337.
- LATA-2009-FredrikssonG #string
- Nested Counters in Bit-Parallel String Matching (KF, SG), pp. 338–349.
- LATA-2009-GauwinNT #bound #concurrent #query
- Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
- LATA-2009-Gierasimczuk #learning #logic
- Learning by Erasing in Dynamic Epistemic Logic (NG), pp. 362–373.
- LATA-2009-GlasserPT #fault tolerance #np-hard #problem
- The Fault Tolerance of NP-Hard Problems (CG, AP, SDT), pp. 374–385.
- LATA-2009-Gnaedig #termination
- Termination of Priority Rewriting (IG), pp. 386–397.
- LATA-2009-HanSY #complexity #regular expression
- State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
- LATA-2009-Hemerik #parsing #taxonomy #towards
- Towards a Taxonomy for ECFG and RRPG Parsing (KH), pp. 410–421.
- LATA-2009-IIBT #array
- Counting Parameterized Border Arrays for a Binary Alphabet (TI, SI, HB, MT), pp. 422–433.
- LATA-2009-ItoLM #bound
- Bounded Hairpin Completion (MI, PL, VM), pp. 434–445.
- LATA-2009-JacquemardKV #automaton
- Rigid Tree Automata (FJ, FK, CV), pp. 446–457.
- LATA-2009-JiraskovaP #automaton #self #verification
- Converting Self-verifying Automata into Deterministic Automata (GJ, GP), pp. 458–468.
- LATA-2009-Kasprzik
- Two Equivalent Regularizations for Tree Adjoining Grammars (AK), pp. 469–480.
- LATA-2009-LiefoogheTV #algorithm #self
- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching (AL, HT, JSV), pp. 481–492.
- LATA-2009-LimayeM #automaton #multi #testing
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (NL, MM), pp. 493–504.
- LATA-2009-LisitsaPS #automaton #word
- Automata on Gauss Words (AL, IP, RS), pp. 505–517.
- LATA-2009-LiuM #automation #complexity
- Analysing Complexity in Classes of Unary Automatic Structures (JL, MM), pp. 518–529.
- LATA-2009-Llull-ChavarriaV #complexity #semantics #word
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words (JLC, OV), pp. 530–541.
- LATA-2009-LopatkovaH #segmentation
- Segmentation Charts for Czech — Relations among Segments in Complex Sentences (ML, TH), pp. 542–553.
- LATA-2009-Masopust #context-free grammar #generative #power of
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (TM), pp. 554–565.
- LATA-2009-MatobaNT #bias #performance #symmetry
- Efficiency of the Symmetry Bias in Grammar Acquisition (RM, MN, ST), pp. 566–577.
- LATA-2009-MatsubaraKBS #string
- A Series of Run-Rich Strings (WM, KK, HB, AS), pp. 578–587.
- LATA-2009-MitranaT #network #on the
- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes (VM, BT), pp. 588–600.
- LATA-2009-Moore #data access #documentation #generative #problem
- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates (NM), pp. 601–613.
- LATA-2009-NakamuraHT #predict
- Prediction of Creole Emergence in Spatial Language Dynamics (MN, TH, ST), pp. 614–625.
- LATA-2009-Nicaud #automaton #on the
- On the Average Size of Glushkov’s Automata (CN), pp. 626–637.
- LATA-2009-Ollinger
- Tiling the Plane with a Fixed Number of Polyominoes (NO), pp. 638–647.
- LATA-2009-Onodera #locality #using
- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality (KO), pp. 648–659.
- LATA-2009-PardubskaPO #automaton #communication #correctness #on the #parallel
- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.
- LATA-2009-PribavkinaR #automaton
- Finitely Generated Synchronizing Automata (EVP, ER), pp. 672–683.
- LATA-2009-Roman #algorithm #search-based
- Genetic Algorithm for Synchronization (AR), pp. 684–695.
- LATA-2009-Salimov #complexity #infinity #word
- Constructing Infinite Words of Intermediate Arithmetical Complexity (PVS), pp. 696–701.
- LATA-2009-ScornavaccaBR #approach
- From Gene Trees to Species Trees through a Supertree Approach (CS, VB, VR), pp. 702–714.
- LATA-2009-Strassburger #theorem
- A Kleene Theorem for Forest Languages (LS), pp. 715–727.
- LATA-2009-SumanP #automaton #integer
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions (PVS, PKP), pp. 728–739.
- LATA-2009-VerwerWW #automaton
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (SV, MdW, CW), pp. 740–751.
15 ×#automaton
8 ×#complexity
7 ×#word
5 ×#algorithm
5 ×#on the
5 ×#problem
3 ×#bound
3 ×#learning
3 ×#multi
3 ×#regular expression
8 ×#complexity
7 ×#word
5 ×#algorithm
5 ×#on the
5 ×#problem
3 ×#bound
3 ×#learning
3 ×#multi
3 ×#regular expression