New Formal Languages and Automata Theory papers from arxiv.org: automata theory. Thank you to arXiv for use of its open access interoperability.
Joined March 2010
- Tweets 3,736
- Following 3
- Followers 153
- Likes 2
148 Photos and videos
Language Acceptors with a Pushdown: Characterizations and Complexity
Oscar H. Ibarra, Ian McQuillan
arxiv.org/abs/2606.13758 [ππ.π΅π»]
1
26
Runtime Enforcement of Hybrid System Properties
Mir Md Sajid Sarwar, Srinivas Pinisetty, Rajarshi Ray, Thierry JΓ©ron
arxiv.org/abs/2606.12022 [ππ.π΅π» ππ.π°πΈ]
1
3
90
Weighing Timed Regular Languages: The Final Step (long version)
Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo InclΓ‘n
arxiv.org/abs/2606.11003 [ππ.π΅π» ππ.πΈπ]
π¬Accepted to QEST FORMATS 2026 conference
1
209
On the Complexity of the Bi-infinite Post Correspondence Problem
Olivier Finkel, Vesa Halava
arxiv.org/abs/2606.10930 [ππ.π΅π» ππ.π³πΌ]
30
Compiling Rewrite Rules to Finite-State Transducers with the Worsening Trick
Mans Hulden, Michael Ginn
arxiv.org/abs/2606.10059 [ππ.π΅π» ππ.π²π»]
1
29
An Empirical Comparison of General Context-Free Parsers
Huan Vo, Danushka Liyanage, Hong Jin Kang, Sasha Rubin, Rahul Gopinath
arxiv.org/abs/2606.08465 [ππ.π΅π» ππ.πΏπ΅ ππ.πΏπ» ππ.ππ΄]
1
28
A remark on diagnosability verification
Kuize Zhang
arxiv.org/abs/2606.07701 [ππ.π΅π» ππππ.πΎπ²]
1
2
27
Passive Learning of Symbolic Automata over Monotonic Algebras
Erwann Loulergue, Peter Habermehl
arxiv.org/abs/2606.06050 [ππ.π΅π»]
1
7
273
Correct-by-Construction Design of Timed Systems in Event-B
Guillaume Dupont, Jun Sun
arxiv.org/abs/2606.05939 [ππ.π΅π»]
1
33
An Algebraic View of the Expressivity of Recurrent Language Models
Franz Nowak, Ryan Cotterell, Reda Boumasmoud
arxiv.org/abs/2606.01765 [ππ.π΅π» ππ.π²π» ππ.π»πΆ]
1
2
282
Bandwidth of Nondeterministic Finite Automata
Da-Jung Cho, SzilΓ‘rd Zsolt Fazekas, Daihei Ise, Shinnosuke Seki, Wataru Tamehira, Max WiedenhΓΆft
arxiv.org/abs/2606.00663 [ππ.π΅π»]
π¬Accepted at CIAA 2026
1
2
95
One Adaptive Trailing Head Can Outperform Many Oblivious Trailing Heads
Julianne Cruz, Sho Glashausser, Neil Lutz
arxiv.org/abs/2606.00127 [ππ.π΅π» ππ.π³πΌ ππ.πΈπ]
24
The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
Wei Luo
arxiv.org/abs/2605.30389 [ππ.π΅π» ππ.π»πΆ]
1
1
52
Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
Faruk Alpay, Baris Basaran
arxiv.org/abs/2605.28884 [ππ.π΅π» ππ.π»πΎ]
1
31
Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
Enzo Erlich, JΓ©rΓ©my Ledent, Krzysztof ZiemiaΕski
arxiv.org/abs/2605.25253 [ππ.π΅π»]
1
2
104
AGDES: Automatic Generation of Dependent Event Sequences
Alexander Obeid Guzman
arxiv.org/abs/2605.23808 [ππ.π΅π»]
35
Intersecting Dense Automata
Dmitry Chistikov, Neha Rino
arxiv.org/abs/2605.20421 [ππ.π΅π» ππ.π»πΎ]
33
On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
Alberto Dennunzio, Maximilien Gadouleau, Luca Mariot
arxiv.org/abs/2605.18875 [ππ.π΅π» ππππ.π²πΎ]
1
42
Do CFLOBDDs Actually Make Use of Linear Structure?
Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps
arxiv.org/abs/2605.15552 [ππ.π΅π»]
43
An L# Based Algorithm for Active Learning of Minimal Separating Automata
Jasper Laumen, Leonne Snel, Frits Vaandrager
arxiv.org/abs/2605.15294 [ππ.π΅π»]
1
32