7th International Conference on Language
and Automata Theory and Applications
LATA 2013, April 2 - 5, 2013
Bilbao, Spain
Program
Tuesday, April 28:00 – 8:50 Registration8:50 – 9:00 Opening9:00 – 9:50ThomasZeugmann
JIN-YI CAI: Complexity Dichotomy for Counting Problems – Invited Lecture
9:50 – 10:00 Break10:00 – 11:40Eli Shamir
BRINK VAN DER MERWE, MARK FARAG, AND JACO GELDENHUYS:Counting Minimal Symmetric Difference NFAsHENNING FERNAU, PINAR HEGGERNES, YNGVE VILLANGER: A Multi-variate Analysis of Some DFA ProblemsRODRIGO DE SOUZA: Uniformisation of Two-Way TransducersKENJI HASHIMOTO, RYUTA SAWADA, YASUNORI ISHIHARA, HIROYUKISEKI, TORU FUJIWARA: Determinacy and Subsumption for Single-ValuedBottom-Up Tree Transducers
11:40 – 12:10 Coffee Break12:10 – 13:50Jin-Yi Cai
AISTIS ATMINAS, VADIM LOZIN, MIKHAIL MOSHKOV: Deciding WQOfor Factorial LanguagesELI SHAMIR: Pumping, Shrinking and Pronouns: from Context Free to In-dexed GrammarsKRISHNENDU CHATTERJEE, SIDDHESH CHAUBAL, SASHA RUBIN: Howto Travel Between LanguagesCEWEI CUI, ZHE DANG, THOMAS R. FISCHER, OSCAR H. IBARRA: Exe-cution Information Rate for Some Classes of Automata
13:50 – 15:30 Lunch15:30 – 17:10Francine
ÉRIC LAUGEROTTE, NADIA OUALI SEBTI, DJELLOUL ZIADI: From Regu-lar Tree Expression to Position Tree Automaton
Blanchet-Sadri STUART HABER, WILLIAM HORNE, PRATYUSA MANADHATA, MI-RANDA MOWBRAY, PRASAD RAO: Efficient Submatch Extraction for Practi-cal Regular ExpressionDANIEL GOC, HAMOON MOUSAVI, JEFFREY SHALLIT: On the Number ofUnbordered FactorsJÖRG ENDRULLIS, CLEMENS GRABMAYER, DIMITRI HENDRIKS: Mix-Automatic Sequences
17:10 – 17:20 Break17:20 – 18:10KoushaEtessami
JOËL OUAKNINE: Discrete Linear Dynamical Systems (I) – Invited Tutorial
Wednesday, April 39:00 – 9:50KoushaEtessami
JOËL OUAKNINE: Discrete Linear Dynamical Systems (II) – Invited Tutorial
9:50 – 10:00 Break10:00 – 11:40Bala
GIORGIO DELZANNO, RICCARDO TRAVERSO: Decidability and ComplexityResults for Verification of Asynchronous Broadcast Networks
Ravikumar TIM SMITH: Infiniteness and Boundedness in 0L, DT0L, and T0L SystemsFABRIZIO BIONDI, AXEL LEGAY, BO FRIIS NIELSEN, ANDRZEJ WA-SOWSKI: Maximizing Entropy over Markov ProcessesOLGA TVERETINA: A Conditional Superpolynomial Lower Bound for Ex-tended Resolution
11:40 – 12:10 Coffee Break12:10 – 13:50Riccardo
SEBASTIAN BALA, ARTUR KONINSKI: Unambiguous Automata DenotingFinitely Sequential Functions
Dondi BENEDIKT BOLLIG, AISWARYA CYRIAC, LOÏC HÉLOUËT, AHMET KARA,THOMAS SCHWENTICK: Dynamic Communicating Automata and BranchingHigh-Level MSCsPARISA BABAALI, CHRISTOPHER KNAPLUND: On the Construction of aFamily of Automata that are Generically Non-MinimalSEBASTIAN BALA, DARIUSZ JACKOWSKI: Limited Non-Determinism Hier-archy of Counter Automata
13:50 – 15:30 Lunch15:30 – 16:20Jörg Endrullis
RUSINŠ FREIVALDS, THOMAS ZEUGMANN, GRANT POGOSYAN: On theSize Complexity of Deterministic Frequency AutomataJOHANNA BJÖRKLUND, HENNING FERNAU, ANNA KASPRZIK: MATLearning of Universal Automata
16:20 – 16:30 Break16:30 – 17:20Joël Ouaknine
LUKE ONG: Recursion Schemes, Collapsible Pushdown Automata, and Higher-Order Model Checking (I) – Invited Tutorial
17:30 Visit to the City
Guggenheim Museum Flower Puppy
Thursday, April 49:00 – 9:50Joël Ouaknine
LUKE ONG: Recursion Schemes, Collapsible Pushdown Automata, and Higher-Order Model Checking (II) – Invited Tutorial
9:50 – 10:00 Break10:00 – 11:40Luke Ong
VICTOR SELIVANOV, ANTON KONOVALOV: Boolean Algebras of Regularω-LanguagesANGELO MONTANARI, PIETRO SALA: Interval Logics and ωB-Regular Lan-guagesKARIN QUAAS: Model Checking Metric Temporal Logic over Automata withone CounterTAKAHITO AOTO, MUNEHIRO IWAMI: Termination of Rule-Based Calculifor Uniform Semi-Unification
11:40 – 12:10 Coffee Break12:10 – 13:50Vadim Lozin
JURRIAAN ROT, MARCELLO BONSANGUE, JAN RUTTEN: CoinductiveProof Techniques for Language EquivalenceXIAOJIE DENG, YU ZHANG, YUXIN DENG, FARONG ZHONG: TheBuffered π-calculus: A Model for Concurrent LanguagesMICHAEL LUTTENBERGER, MAXIMILIAN SCHLUND: Convergence of New-ton’s Method over Commutative SemiringsMILKA HUTAGALUNG, MARTIN LANGE, ETIENNE LOZES: Revealing vs.Concealing: More Simulation Games for Büchi Inclusion
13:50 – 15:30 Lunch15:30 – 17:10Yuxin Deng
OSCAR IBARRA, BALA RAVIKUMAR: On Bounded Languages and Reversal-Bounded AutomataKATSUHIKO NAKAMURA, KEITA IMADA: Eliminating Stack Symbols inPush-Down Automata and Linear Indexed GrammarsVÉRONIQUE BRUYÈRE, MARC DUCOBU, OLIVIER GAUWIN: Visibly Push-down Automata: Universality and Inclusion via AntichainsFLORENT JACQUEMARD, MICHAEL RUSINOWITCH: Rewrite Closure andCF Hedge Automata
17:10 – 17:20 Break17:20 – 18:10Eljas Soisalon-Soininen
THOMAS SCHWENTICK: XML Schema Management: a Challenge for Au-tomata Theory – Invited Lecture
Calatrava Bridge (Zubizuri)
Friday, April 59:00 – 9:50AndreiVoronkov
KOUSHA ETESSAMI: Algorithms for Analyzing and Verifying Infinite-StateRecursive Probabilistic Systems – Invited Lecture
9:50 – 10:00 Break10:00 – 11:40 FRIEDRICH OTTO: Asynchronous PC Systems of Pushdown AutomataBenedikt Bollig STANISLAV ŽÁK, JIRÍ ŠÍMA: A Turing Machine Distance Hierarchy
TOMASZ KOCIUMAKA, JAKUB RADOSZEWSKI, WOJCIECH RYTTER,TOMASZ WALEN: Linear-Time Version of Holub’s Algorithm for Morphic Im-primitivity TestingRAJEEV ALUR, SAMPATH KANNAN, KEVIN TIAN, YIFEI YUAN: On TheComplexity of Shortest Path Problems on Discounted Cost Graphs
11:40 – 12:10 Coffee Break12:10 – 13:50Tomasz Walen
FRANCINE BLANCHET-SADRI, JUSTIN LAZAROW: Suffix Trees for PartialWords and the Longest Common Compatible Prefix ProblemDANIEL GOC, KALLE SAARI, JEFFREY SHALLIT: Primitive Words and Lyn-don Words in Automatic and Linearly Recurrent SequencesFRANCINE BLANCHET-SADRI, MICHELLE BODNAR, NATHAN FOX,JOE HIDAKATSU: A Graph Polynomial Approach to PrimitivityLUKE SCHAEFFER: Ostrowski Numeration and the Local Period of SturmianWords
13:50 – 15:30 Lunch15:30 – 16:20Rusinš
SEPPO SIPPU, ELJAS SOISALON-SOININEN: Online Matching of MultipleRegular Patterns with Gaps and Character Classes
Freivalds BILLEL BENZAID, RICCARDO DONDI, NADIA EL-MABROUK:Duplication-Loss Genome Alignment: Complexity and Algorithm
16:20 – 16:30 Break16:30 – 17:20Friedrich Otto
ANDREI VORONKOV: The Lazy Reviewer Assignment Problem in EasyChair– Invited Lecture
17:20 Closing
We acknowledge the support by:
Top Related