Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th CIAA 2023: Famagusta, North Cyprus
- Benedek Nagy
:
Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings. Lecture Notes in Computer Science 14151, Springer 2023, ISBN 978-3-031-40246-3
Invited Talks
- Viliam Geffert:
Binary Coded Unary Regular Languages. 3-20 - Friedrich Otto:
A Survey on Automata with Translucent Letters. 21-50
Contributed Papers
- Antonio Al Serhali, Joachim Niehren:
Earliest Query Answering for Deterministic Stepwise Hedge Automata. 53-65 - Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart:
Constrained Multi-Tildes. 66-78 - Václav Blazej, Jan Janousek, Stepán Plachý:
On the Smallest Synchronizing Terms of Finite Tree Automata. 79-90 - Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Universal First-Order Quantification over Automata. 91-102 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. 103-115 - Szilárd Zsolt Fazekas, Robert Mercas:
Sweep Complexity Revisited. 116-127 - Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Regular Languages is Hard. 128-140 - Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han:
M-equivalence of Parikh Matrix over a Ternary Alphabet. 141-152 - Michal Hospodár, Galina Jirásková:
Operational Complexity in Subregular Classes. 153-165 - Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki:
When Is Context-Freeness Distinguishable from Regularity? an Extension of Parikh's Theorem. 166-178 - Shmuel T. Klein, Dana Shapira:
Enhanced Ternary Fibonacci Codes. 179-193 - Martin Kutrib:
Sweeping Input-Driven Pushdown Automata. 194-205 - Kevin Lotz, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen, Anders Schlichtkrull:
Verified Verifying: SMT-LIB for Strings in Isabelle. 206-217 - Andreas Maletti, Andreea-Teodora Nász:
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. 218-229 - Sebastian Maneth, Martin Vu:
Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer. 230-241 - Olga Martynova, Alexander Okhotin:
A Time to Cast Away Stones. 242-253 - Giovanni Pighizzini, Luca Prigioniero:
Two-Way Machines and de Bruijn Words. 254-265 - Jeffrey O. Shallit, Anatoly Zavyalov:
Transduction of Automatic Sequences and Applications. 266-277 - Ryoma Sin'ya:
Measuring Power of Generalised Definite Languages. 278-289 - Sicheol Sung, Sang-Ki Ko, Yo-Sub Han:
Smaller Representation of Compiled Regular Expressions. 290-301
a service of 
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-06-10 21:36 CEST 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:
