arXiv cs.FL Formal Languages and Automata Theory
@csfl-bot.bsky.social
Unofficial bot by @vele.bsky.social w/ http://github.com/so-okada/bXiv https://arxiv.org/list/cs.FL/new
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
Reposted by arXiv cs.FL Formal Languages and Automata Theory
Changryeol Lee: Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework https://arxiv.org/abs/2602.10991 https://arxiv.org/pdf/2602.10991 https://arxiv.org/html/2602.10991
February 12, 2026 at 6:29 AM
Changryeol Lee: Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework https://arxiv.org/abs/2602.10991 https://arxiv.org/pdf/2602.10991 https://arxiv.org/html/2602.10991
Reposted by arXiv cs.FL Formal Languages and Automata Theory
Derek Christ, Thomas Zimmermann, Philippe Barbie, Dmitri Saberi, Yao Yin, Matthias Jung: DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets https://arxiv.org/abs/2602.10654 https://arxiv.org/pdf/2602.10654 https://arxiv.org/html/2602.10654
February 12, 2026 at 6:29 AM
Derek Christ, Thomas Zimmermann, Philippe Barbie, Dmitri Saberi, Yao Yin, Matthias Jung: DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets https://arxiv.org/abs/2602.10654 https://arxiv.org/pdf/2602.10654 https://arxiv.org/html/2602.10654
Elaine Li, Thomas Wies: Implementability of Global Distributed Protocols modulo Network Architectures https://arxiv.org/abs/2602.10320 https://arxiv.org/pdf/2602.10320 https://arxiv.org/html/2602.10320
February 12, 2026 at 6:31 AM
Elaine Li, Thomas Wies: Implementability of Global Distributed Protocols modulo Network Architectures https://arxiv.org/abs/2602.10320 https://arxiv.org/pdf/2602.10320 https://arxiv.org/html/2602.10320
[2026-02-12 Thu (UTC), 1 new article found for csFL Formal Languages and Automata Theory]
February 12, 2026 at 6:31 AM
[2026-02-12 Thu (UTC), 1 new article found for csFL Formal Languages and Automata Theory]
Hugo Bazille, Uli Fahrenberg: Automata on Graph Alphabets https://arxiv.org/abs/2602.10036 https://arxiv.org/pdf/2602.10036 https://arxiv.org/html/2602.10036
February 11, 2026 at 6:31 AM
Hugo Bazille, Uli Fahrenberg: Automata on Graph Alphabets https://arxiv.org/abs/2602.10036 https://arxiv.org/pdf/2602.10036 https://arxiv.org/html/2602.10036
Olivier Idir: Eve-positional languages: putting order into B\"uchi automata https://arxiv.org/abs/2602.09896 https://arxiv.org/pdf/2602.09896 https://arxiv.org/html/2602.09896
February 11, 2026 at 6:31 AM
Olivier Idir: Eve-positional languages: putting order into B\"uchi automata https://arxiv.org/abs/2602.09896 https://arxiv.org/pdf/2602.09896 https://arxiv.org/html/2602.09896
Yu Wang, Zhaohui Zhu, Rob van Glabbeekd, Jinjin Zhang, Yixuan Li: The Similarity Control Problem with Required Events https://arxiv.org/abs/2602.09360 https://arxiv.org/pdf/2602.09360 https://arxiv.org/html/2602.09360
February 11, 2026 at 6:31 AM
Yu Wang, Zhaohui Zhu, Rob van Glabbeekd, Jinjin Zhang, Yixuan Li: The Similarity Control Problem with Required Events https://arxiv.org/abs/2602.09360 https://arxiv.org/pdf/2602.09360 https://arxiv.org/html/2602.09360
Elaine Li, Felix Stutz: Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking https://arxiv.org/abs/2602.09197 https://arxiv.org/pdf/2602.09197 https://arxiv.org/html/2602.09197
February 11, 2026 at 6:31 AM
Elaine Li, Felix Stutz: Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking https://arxiv.org/abs/2602.09197 https://arxiv.org/pdf/2602.09197 https://arxiv.org/html/2602.09197
[2026-02-11 Wed (UTC), 4 new articles found for csFL Formal Languages and Automata Theory]
February 11, 2026 at 6:31 AM
[2026-02-11 Wed (UTC), 4 new articles found for csFL Formal Languages and Automata Theory]
Reposted by arXiv cs.FL Formal Languages and Automata Theory
V\'eronique Bruy\`ere, Emmanuel Filiot, Christophe Grandmont, Jean-Fran\c{c}ois Raskin: An Automata-Based Approach to Games with $\omega$-Automatic Preferences https://arxiv.org/abs/2602.08549 https://arxiv.org/pdf/2602.08549 https://arxiv.org/html/2602.08549
February 10, 2026 at 6:32 AM
V\'eronique Bruy\`ere, Emmanuel Filiot, Christophe Grandmont, Jean-Fran\c{c}ois Raskin: An Automata-Based Approach to Games with $\omega$-Automatic Preferences https://arxiv.org/abs/2602.08549 https://arxiv.org/pdf/2602.08549 https://arxiv.org/html/2602.08549
Reposted by arXiv cs.FL Formal Languages and Automata Theory
Nathana\"el Fijalkow, Arka Ghosh, Roman Kniazev, Guillermo A. P\'erez, Pierre Vandenhove: Computing the Reachability Value of Posterior-Deterministic POMDPs https://arxiv.org/abs/2602.07473 https://arxiv.org/pdf/2602.07473 https://arxiv.org/html/2602.07473
February 10, 2026 at 6:29 AM
Nathana\"el Fijalkow, Arka Ghosh, Roman Kniazev, Guillermo A. P\'erez, Pierre Vandenhove: Computing the Reachability Value of Posterior-Deterministic POMDPs https://arxiv.org/abs/2602.07473 https://arxiv.org/pdf/2602.07473 https://arxiv.org/html/2602.07473
Nicola Cotumaccio: Wheeler Bisimulations https://arxiv.org/abs/2602.07964 https://arxiv.org/pdf/2602.07964 https://arxiv.org/html/2602.07964
February 10, 2026 at 6:31 AM
Nicola Cotumaccio: Wheeler Bisimulations https://arxiv.org/abs/2602.07964 https://arxiv.org/pdf/2602.07964 https://arxiv.org/html/2602.07964
[2026-02-10 Tue (UTC), 1 new article found for csFL Formal Languages and Automata Theory]
February 10, 2026 at 6:31 AM
[2026-02-10 Tue (UTC), 1 new article found for csFL Formal Languages and Automata Theory]
[2026-02-09 Mon (UTC), no new articles found for csFL Formal Languages and Automata Theory]
February 9, 2026 at 6:31 AM
[2026-02-09 Mon (UTC), no new articles found for csFL Formal Languages and Automata Theory]
Elisabetta De Maria, Christopher Leturc: A Probabilistic Model-Checking Framework for Cognitive Assessment and Training https://arxiv.org/abs/2602.03643 https://arxiv.org/pdf/2602.03643 https://arxiv.org/html/2602.03643
February 4, 2026 at 7:24 AM
Elisabetta De Maria, Christopher Leturc: A Probabilistic Model-Checking Framework for Cognitive Assessment and Training https://arxiv.org/abs/2602.03643 https://arxiv.org/pdf/2602.03643 https://arxiv.org/html/2602.03643
[2026-02-04 Wed (UTC), 1 new article found for csFL Formal Languages and Automata Theory]
February 4, 2026 at 7:24 AM
[2026-02-04 Wed (UTC), 1 new article found for csFL Formal Languages and Automata Theory]
Reposted by arXiv cs.FL Formal Languages and Automata Theory
Keishu Utimula: LOGOS-CA: A Cellular Automaton Using Natural Language as State and Rule https://arxiv.org/abs/2602.00036 https://arxiv.org/pdf/2602.00036 https://arxiv.org/html/2602.00036
February 3, 2026 at 6:45 AM
Keishu Utimula: LOGOS-CA: A Cellular Automaton Using Natural Language as State and Rule https://arxiv.org/abs/2602.00036 https://arxiv.org/pdf/2602.00036 https://arxiv.org/html/2602.00036
Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst: Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets https://arxiv.org/abs/2602.02447 https://arxiv.org/pdf/2602.02447 https://arxiv.org/html/2602.02447
February 3, 2026 at 6:31 AM
Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst: Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets https://arxiv.org/abs/2602.02447 https://arxiv.org/pdf/2602.02447 https://arxiv.org/html/2602.02447
Petr Jancar, Eike Best, Raymond Devillers, Matej Ostadal: Well-Formed Free-Choice Petri Nets Revisited https://arxiv.org/abs/2602.02352 https://arxiv.org/pdf/2602.02352 https://arxiv.org/html/2602.02352
February 3, 2026 at 6:31 AM
Petr Jancar, Eike Best, Raymond Devillers, Matej Ostadal: Well-Formed Free-Choice Petri Nets Revisited https://arxiv.org/abs/2602.02352 https://arxiv.org/pdf/2602.02352 https://arxiv.org/html/2602.02352
Shaull Almagor, Guy Arbel, Sarai Sheinvald: A Complexity Bound for Determinisation of Min-Plus Weighted Automata https://arxiv.org/abs/2602.01221 https://arxiv.org/pdf/2602.01221 https://arxiv.org/html/2602.01221
February 3, 2026 at 6:31 AM
Shaull Almagor, Guy Arbel, Sarai Sheinvald: A Complexity Bound for Determinisation of Min-Plus Weighted Automata https://arxiv.org/abs/2602.01221 https://arxiv.org/pdf/2602.01221 https://arxiv.org/html/2602.01221
Subin Pulari: On Normality and Equidistribution for Separator Enumerators https://arxiv.org/abs/2602.01199 https://arxiv.org/pdf/2602.01199 https://arxiv.org/html/2602.01199
February 3, 2026 at 6:31 AM
Subin Pulari: On Normality and Equidistribution for Separator Enumerators https://arxiv.org/abs/2602.01199 https://arxiv.org/pdf/2602.01199 https://arxiv.org/html/2602.01199
[2026-02-03 Tue (UTC), 4 new articles found for csFL Formal Languages and Automata Theory]
February 3, 2026 at 6:31 AM
[2026-02-03 Tue (UTC), 4 new articles found for csFL Formal Languages and Automata Theory]
Reposted by arXiv cs.FL Formal Languages and Automata Theory
Damion Harvey, Geraud Nangue Tasse, Branden Ingram, Benjamin Rosman, Steven James: Unsupervised Hierarchical Skill Discovery https://arxiv.org/abs/2601.23156 https://arxiv.org/pdf/2601.23156 https://arxiv.org/html/2601.23156
February 2, 2026 at 6:35 AM
Damion Harvey, Geraud Nangue Tasse, Branden Ingram, Benjamin Rosman, Steven James: Unsupervised Hierarchical Skill Discovery https://arxiv.org/abs/2601.23156 https://arxiv.org/pdf/2601.23156 https://arxiv.org/html/2601.23156
Reposted by arXiv cs.FL Formal Languages and Automata Theory
Kanishk Awadhiya: Bifocal Attention: Harmonizing Geometric and Spectral Positional Embeddings for Algorithmic Generalization https://arxiv.org/abs/2601.22402 https://arxiv.org/pdf/2601.22402 https://arxiv.org/html/2601.22402
February 2, 2026 at 6:30 AM
Kanishk Awadhiya: Bifocal Attention: Harmonizing Geometric and Spectral Positional Embeddings for Algorithmic Generalization https://arxiv.org/abs/2601.22402 https://arxiv.org/pdf/2601.22402 https://arxiv.org/html/2601.22402
Robin Bergenthum, Jakub Kov\'a\v{r}: Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions https://arxiv.org/abs/2601.23130 https://arxiv.org/pdf/2601.23130 https://arxiv.org/html/2601.23130
February 2, 2026 at 6:31 AM
Robin Bergenthum, Jakub Kov\'a\v{r}: Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions https://arxiv.org/abs/2601.23130 https://arxiv.org/pdf/2601.23130 https://arxiv.org/html/2601.23130