Simulation by Rounds of Letter-to-Letter Transducers by Antonio Abu Nassar, Shaull Almagor

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Priced Timed Petri Nets by Richard M. Mayr, Parosh Aziz Abdulla

Subjects: “…computer science - formal languages and automata theory…”
Get full text

A Load-Buffer Semantics for Total Store Ordering by Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Tuan Phong Ngo

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Separating Regular Languages with First-Order Logic by Thomas Place, Marc Zeitoun

Subjects: “…computer science - formal languages and automata theory…”
Get full text

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems by J. Leroux, M. Praveen, Ph. Schnoebelen, G. Sutre

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise by Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Covering and separation for logical fragments with modular predicates by Thomas Place, Varun Ramanathan, Pascal Weil

Subjects: “…computer science - formal languages and automata theory…”
Get full text

State of B\"uchi Complementation by Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi, Yih-Kuen Tsay

Subjects: “…computer science - formal languages and automata theory…”
Get full text

One-way definability of two-way word transducers by Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Anthony W. Lin, Rupak Majumdar

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Decision Questions for Probabilistic Automata on Small Alphabets by Paul C. Bell, Pavel Semukhin

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata by Vojtěch Forejt, Petr Jančar, Stefan Kiefer, James Worrell

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Timed Automata Robustness Analysis via Model Checking by Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Černá

Subjects: “…computer science - formal languages and automata theory…”
Get full text

An efficient algorithm to decide periodicity of $b$-recognisable sets using LSDF convention by Victor Marsault

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata by Preugschat Sebastian, Thomas Wilke

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Boundedness in languages of infinite words by Mikołaj Bojańczyk, Thomas Colcombet

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption by Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Algebraic Structure of Combined Traces by Lukasz Mikulski

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata by Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel

Subjects: “…computer science - formal languages and automata theory…”
Get full text

Partially Ordered Automata and Piecewise Testability by Tomáš Masopust, Markus Krötzsch

Subjects: “…computer science - formal languages and automata theory…”
Get full text