default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th LATA 2019: St. Petersburg, Russia
- Carlos Martín-Vide, Alexander Okhotin, Dana Shapira:
Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings. Lecture Notes in Computer Science 11417, Springer 2019, ISBN 978-3-030-13434-1
Invited Papers
- Henning Fernau
:
Modern Aspects of Complexity Within Formal Languages. 3-30 - Edward A. Lee:
Observation and Interaction - Invited Paper. 31-42 - Vadim V. Lozin:
From Words to Graphs, and Back. 43-54
Automata
- Malek Anabtawi, Sabit Hassan, Christos A. Kapoutsis, Mohammad Zakzok:
An Oracle Hierarchy for Small One-Way Finite Automata. 57-69 - Tim Becker, Klaus Sutner:
Orbits of Abelian Automaton Groups. 70-81 - Alex Bishop, Murray Elder:
Bounded Automata Groups are co-ET0L. 82-94 - Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca:
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata. 95-107 - Ondrej Klíma, Libor Polák:
On Varieties of Ordered Automata. 108-120 - Klaus Meer, Ameen Naif:
Automata over Infinite Sequences of Reals. 121-133 - Tomoyuki Yamakami:
Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice. 134-145 - Vladimir A. Zakharov:
Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata. 146-158 - Ilya Zakirzyanov, António Morgado, Alexey Ignatiev, Vladimir Ulyantsev, João Marques-Silva:
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference. 159-173
Complexity
- Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery:
Closure and Nonclosure Properties of the Compressible and Rankable Sets. 177-189 - Markus Holzer, Michal Hospodár:
The Range of State Complexities of Languages Resulting from the Cut Operation. 190-202 - Lila Kari, Timothy Ng:
State Complexity of Pseudocatenation. 203-214 - Stephen A. Fenner, Daniel Padé:
Complexity of Regex Crosswords. 215-230
Grammars
- Berthold Hoffmann, Mark Minas:
Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars. 233-245 - Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye:
Transformation of Petri Nets into Context-Dependent Fusion Grammars. 246-258 - Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki:
Generalized Register Context-Free Grammars. 259-271
Languages
- Amazigh Amrane, Nicolas Bedon:
Logic and Rational Languages of Scattered and Countable Series-Parallel Posets. 275-287 - Marcella Anselmo, Maria Madonia, Carla Selmi:
Toroidal Codes and Conjugate Pictures. 288-301 - Jean-Philippe Dubernard, Giovanna Guaiana, Ludovic Mignot:
Geometrical Closure of Binary V_3/2 Languages. 302-314 - Galina Jirásková, Ondrej Klíma:
Deterministic Biautomata and Subclasses of Deterministic Linear Languages. 315-327 - Alexis Linard, Colin de la Higuera, Frits W. Vaandrager:
Learning Unions of k-Testable Languages. 328-339
Graphs, Trees and Rewriting
- Iovka Boneva, Joachim Niehren, Momar Sakho:
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. 343-355 - Ajay Kumar Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Rule-Based Unification in Combined Theories and the Finite Variant Property. 356-367 - Pawel Parys:
Extensions of the Caucal Hierarchy? 368-380 - Ahad N. Zehmakan:
Tight Bounds on the Minimum Size of a Dynamic Monopoly. 381-393
Words and Codes
- Émilie Charlier, Svetlana Puzynina, Élise Vandomme:
Recurrence in Multidimensional Words. 397-408 - Christophe Cordero:
A Note with Computer Exploration on the Triangle Conjecture. 409-420 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. 421-433 - Kalpana Mahalingam, Palak Pandoh:
On the Maximum Number of Distinct Palindromic Sub-arrays. 434-446 - Wojciech Rytter, Wiktor Zuba:
Syntactic View of Sigma-Tau Generation of Permutations. 447-459 - Clemens Müllner, Andrew Ryzhikov:
Palindromic Subsequences in Finite Words. 460-468
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
