Formal Languages and Automata Theory Papers

New Formal Languages and Automata Theory papers from automata theory. Thank you to arXiv for use of its open access interoperability.

[Formal Languages and Automata Theory Papers @FormalLanguages]

Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarch

Xiaoyu Li, Andi Han, Jiaojiao Jiang, Junbin Gao
https://t.co/ldEKa0Ji0N [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙶]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Execution-Time Opacity Logic: A Logic for Ensuring ET-Opacity in Timed Systems

Jean Leneutre, Dylan Marinho, Vadim Malvone, James Ortiz
https://t.co/C2684SXEZm [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Graph-based automata

Cyril Pujol
https://t.co/Jfscoe79I2 [𝚌𝚜.𝙵𝙻 𝚖𝚊𝚝𝚑.𝙲𝙾]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Solution to Bucher's density problem for context-free languages

Rastko Maslic, Jeffrey Shallit
https://t.co/4Qu1igU8cp [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

An Elementary Proof of the Õ(n¹/³) Bound for Separating Words

Chen Xu
https://t.co/GVZDW8qYDt [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙲𝙲 𝚖𝚊𝚝𝚑.𝙲𝙾]

[Formal Languages and Automata Theory Papers @FormalLanguages]

From Ramsey-Based to Congruence-Based Constructions for Büchi Complementation

Yih-Kuen Tsay, Moshe Y. Vardi
https://t.co/vlQ50tU9DO [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙾]

[Formal Languages and Automata Theory Papers @FormalLanguages]

On the equivalence between generating functions computed by memory transducers and enumerating functions produced by indexed grammars

Vincent Ghigo
https://t.co/nt9GvSyReJ [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Languages and Recognition in a Category with Factorisation

Harsh Beohar, Mike Cruchten, Georg Struth
https://t.co/uOeIK6mRdo [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙾]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Relative Prime Factorization and Finite-State Presentations under Fixed Finite-Monoid Observation

Takayuki Kuriyama
https://t.co/AWXzUnLHOJ [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙶]

[Formal Languages and Automata Theory Papers @FormalLanguages]

NeuroSTAR: Automata-guided Neuro-symbolic Specification Formalization

Joy Saha, Trey Woodlief, Sebastian Elbaum, Matthew B. Dwyer
https://t.co/d7NM29S3xz [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Behavioral Memory under Symmetry in One-Way Quantum Automata

Zeyu Chen
https://t.co/ZpNmMHqCq3 [𝚌𝚜.𝙵𝙻 𝚚𝚞𝚊𝚗𝚝-𝚙𝚑]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Verification of K- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions

Jiahui Zhang, Kuize Zhang, Xiaoguang Han, Zhiwu Li
https://t.co/Tdt0VjWhkK [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙲𝚁]

[Formal Languages and Automata Theory Papers @FormalLanguages]

On smallest synchronizing terms over constant alphabets

Luisa Herrmann, Richard Mörbitz
https://t.co/7JTACuNPOc [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Construction of a DFA for Computing Grundy Numbers in the Successful Derivation Games on Right-Linear Grammars

Yoshiaki Takata, Yusuke Inoue, Hiroyuki Seki
https://t.co/ecCuwbBRDD [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙶𝚃]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Two-State Max-Plus Comparison Is Decidable

Keigo Oka
https://t.co/Z4d6sB0L3l [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙳𝚂]

[Formal Languages and Automata Theory Papers @FormalLanguages]

A note on the reduction from LTLf to LTL

Alexandre Duret-Lutz
https://t.co/7fwyDbgXts [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙾]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Further Remarks on Separating Words

John Nicol
https://t.co/TvXW9z76Aq [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Finite-Monoid Compression in Syntactic Concept Lattices: Arity Hierarchies and a Pseudovariety Trichotomy

Takayuki Kuriyama
https://t.co/WbOVuzc375 [𝚌𝚜.𝙵𝙻 𝚖𝚊𝚝𝚑.𝙶𝚁]

[Formal Languages and Automata Theory Papers @FormalLanguages]

The Emptiness Problem for Quantum Finite Automata with Classical States

Jyun-Ao Lin, Patrick Totzke, Yun Chen Tsai, Di-De Yen
https://t.co/qpLWj9XTUp [𝚌𝚜.𝙵𝙻]

[Formal Languages and Automata Theory Papers @FormalLanguages]

Defining the Crick-Franklin-Watson genes of any robot (equals a finite state machine) and defining the Shannon genetic code attached to each gene. We also define the Krohn-Rhodes complexity of any regular maximal prefix code
https://t.co/tjtgYeQaiq [𝚌𝚜.𝙵𝙻 𝚖𝚊𝚝𝚑.𝙿𝚁]