CIAA C

23 papers

YearTitle / Authors
2023A Survey on Automata with Translucent Letters.
Friedrich Otto
2023A Time to Cast Away Stones.
Olga Martynova, Alexander Okhotin
2023Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions.
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2023Binary Coded Unary Regular Languages.
Viliam Geffert
2023Constrained Multi-Tildes.
Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart
2023Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer.
Sebastian Maneth, Martin Vu
2023Earliest Query Answering for Deterministic Stepwise Hedge Automata.
Antonio Al Serhali, Joachim Niehren
2023Enhanced Ternary Fibonacci Codes.
Shmuel T. Klein, Dana Shapira
2023Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings
Benedek Nagy
2023M-equivalence of Parikh Matrix over a Ternary Alphabet.
Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han
2023Measuring Power of Generalised Definite Languages.
Ryoma Sin'ya
2023On the Smallest Synchronizing Terms of Finite Tree Automata.
Václav Blazej, Jan Janousek, Stepán Plachý
2023Operational Complexity in Subregular Classes.
Michal Hospodár, Galina Jirásková
2023Smaller Representation of Compiled Regular Expressions.
Sicheol Sung, Sang-Ki Ko, Yo-Sub Han
2023Sweep Complexity Revisited.
Szilárd Zsolt Fazekas, Robert Mercas
2023Sweeping Input-Driven Pushdown Automata.
Martin Kutrib
2023The Pumping Lemma for Regular Languages is Hard.
Hermann Gruber, Markus Holzer, Christian Rauch
2023Transduction of Automatic Sequences and Applications.
Jeffrey O. Shallit, Anatoly Zavyalov
2023Two-Way Machines and de Bruijn Words.
Giovanni Pighizzini, Luca Prigioniero
2023Universal First-Order Quantification over Automata.
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2023Verified Verifying: SMT-LIB for Strings in Isabelle.
Kevin Lotz, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen, Anders Schlichtkrull
2023Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable.
Andreas Maletti, Andreea-Teodora Nász
2023When Is Context-Freeness Distinguishable from Regularity? an Extension of Parikh's Theorem.
Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki