Boxes in Infinite Words: Complexity, Automata, and Point Modules
Jason Bell
https://t.co/7y1yOpkoBR [ππ.π΅π» ππππ.π»πΎ ππππ.ππ°]
The Left Ripple of Byte-Pair Encoding: Certified Lookbehind for Every Dictionary
Nicklas NidhΓΆgg
https://t.co/YfWP8Uaawd [ππ.π΅π» ππ.π²π» ππ.π³π ππ.πΏπ»]
Two barriers for minimal time firing squads, with applications to four and five states
Kia Keng Giam
https://t.co/8hqZKaFX21 [ππ.π΅π» ππππ.π²πΆ]
Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches
MikoΕaj BojaΕczyk, Antonio Casares, Sven Manthe, PaweΕ Parys
https://t.co/dj10cFA3py [ππ.π΅π» ππ.π»πΎ]
Reliability-Aware Z-Grammars and Z-Automata over a Credible-Grade Semiring
Sherzod Turaev, Nor Haniza Sarmin, Wan Heng Fong
https://t.co/OU71pz27P6 [ππ.π΅π» ππ.π»πΎ]
The Scope Grammar of Natural-Language Rules: Counting and Enumerating Readings modulo Logical Equivalence
Sherzod Turaev, Mary John
https://t.co/QSRTNIHrYC [ππ.π΅π» ππ.π²π» ππ.π»πΎ]
On Small Universal Reversible Turing Machines
T. Yokoyama
https://t.co/zScuNwhJlv [ππ.π΅π» ππ.π»πΎ]
π¬Code: https://t.co/mGaJDyYCUj
General semiring conditions for weighted L* termination
Noah Bertram, Daniel Luckhardt, Alexandra Silva
https://t.co/BGvlsGsTi9 [ππ.π΅π» ππ.π»πΎ]
Reachability in Five-Dimensional Vector Addition Systems Is PSPACE-Complete
Weijun Chen, Bo Fu, Yuxi Fu
https://t.co/1Wku8i7JuB [ππ.π΅π» ππ.π²π²]