15. DLT 2011: Milan, Italy

Invited Talks

• Golnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore:
  Hunting Redundancies in Strings. 1-14
  
• Antonio Restivo, Roberto Vaglica:
  Some Remarks on Automata Minimality. 15-27
  
• Arseny M. Shur:
  Growth Properties of Power-Free Languages. 28-43
  
• Thomas Wilke:
  A Functional Program for Regular Expressions Matching - Abstract of Invited Talk. 44-45
  
• Sheng Yu, Yuan Gao:
  State Complexity Research and Approximation. 46-57
  

Regular Papers

• Giovanni Battaglia, Roberto Grossi, Noemi Scutellà:
  Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees. 58-69
  
• Francine Blanchet-Sadri, Sean Simmons:
  Avoiding Abelian Powers in Partial Words. 70-81
  
• Paola Bonizzoni, Natasha Jonoska:
  Regular Splicing Languages Must Have a Constant. 82-92
  
• Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
  The Average Transition Complexity of Glushkov and Partial Derivative Automata. 93-104
  
• Janusz A. Brzozowski, Hellis Tamm:
  Theory of Átomata. 105-116
  
• Janusz A. Brzozowski, Yuli Ye:
  Syntactic Complexity of Ideal and Closed Languages. 117-128
  
• Pascal Caron, Yo-Sub Han, Ludovic Mignot:
  Generalized One-Unambiguity. 129-140
  
• Gérard Cécé, Alain Giorgetti:
  Simulations over Two-Dimensional On-Line Tessellation Automata. 141-152
  
• Peter Cerno, Frantisek Mráz:
  Δ-Clearing Restarting Automata and CFL \makebox{\sf CFL}. 153-164
  
• Emilie Charlier, Narad Rampersad, Jeffrey Shallit:
  Enumeration and Decidable Properties of Automatic Sequences. 165-179
  
• Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas:
  Languages vs. ω-Languages in Regular Infinite Games. 180-191
  
• Volker Diekert, Alexei G. Myasnikov:
  Solving Word Problems in Group Extensions over Infinite Words. 192-203
  
• Michael Domaratzki, Narad Rampersad:
  Abelian Primitive Words. 204-215
  
• Zoltán Ésik:
  Scattered Context-Free Linear Orderings. 216-227
  
• Gabriele Fici, Zsuzsanna Lipták:
  On Prefix Normal Words. 228-238
  
• Vladimir V. Gusev, Elena V. Pribavkina:
  On Non-complete Sets and Restivo's Conjecture. 239-250
  
• Benjamin Hellouin de Menibus, Mathieu Sablik:
  Self-organization in Cellular Automata: A Particle-Based Approach. 251-263
  
• Markus Holzer, Sebastian Jakobi:
  Chop Operations and Expressions: Descriptional Complexity Considerations. 264-275
  
• Markus Holzer, Martin Kutrib, Ursula Leiter:
  Nodes Connected by Path Languages. 276-287
  
• Norbert Hundeshagen, Friedrich Otto:
  Characterizing the Regular Languages by Nonforgetting Restarting Automata. 288-299
  
• Oscar H. Ibarra, Hsu-Chun Yen:
  On Two-Way Transducers. 300-311
  
• Juha Kortelainen, Tuukka Salmi:
  There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages. 312-323
  
• Michal Kunc, Alexander Okhotin:
  Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. 324-336
  
• Florin Manea:
  Deciding Networks of Evolutionary Processors. 337-349
  
• Roberto Mantaci, Paolo Massazza:
  From Linear Partitions to Parallelogram Polyominoes. 350-361
  
• Andrey N. Plyushchenko, Arseny M. Shur:
  On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying x² = x³. 362-373
  
• Emanuele Rodaro, Pedro V. Silva:
  Never Minimal Automata and the Rainbow Bipartite Subgraph Problem. 374-385
  
• Victor L. Selivanov, Anton Konovalov:
  Boolean Algebras of Regular Languages. 386-396
  
• Jeffrey Shallit:
  Fife's Theorem Revisited. 397-405
  
• Edita Pelantová, Stepán Starosta:
  Infinite Words Rich and Almost Rich in Generalized Palindromes. 406-416
  
• Nuri Tasdemir, A. C. Cem Say:
  Models of Pushdown Automata with Reset. 417-428
  
• Ryo Yoshinaka:
  Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices. 429-440
  
• Narad Rampersad, Elise Vaslet:
  On Highly Repetitive and Power Free Words. 441-451
  
• Georg Zetzsche:
  A Sufficient Condition for Erasing Productions to Be Avoidable. 452-463
  

Short Papers

• Daniela Battaglino, Jean-Marc Fedou, Andrea Frosini, Simone Rinaldi:
  Encoding Centered Polyominoes by Means of a Regular Language. 464-465
  
• Jérôme Chandesris, Alberto Dennunzio, Enrico Formenti, Luca Manzoni:
  Computational Aspects of Asynchronous Cellular Automata. 466-468
  
• Alessandra Cherubini, Achille Frigeri, Brunetto Piochi:
  Short 3-Collapsing Words over a 2-Letter Alphabet. 469-471
  
• Manfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic:
  A Cascade Decomposition of Weighted Finite Transition Systems. 472-473
  
• Kaoru Fujioka:
  Morphic Characterizations in Terms of Insertion Systems with a Context of Length One. 474-475
  
• Anna Kasprzik:
  Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data. 476-477
  
• Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson:
  On the Representability of Line Graphs. 478-479
  

Last update Sun May 26 01:47:14 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page