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

Automata theory in nominal sets by Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota

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

Cost Preserving Bisimulations for Probabilistic Automata by Andrea Turrini, Holger Hermanns

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

Logics with rigidly guarded data tests by Gabriele Puppis, Thomas Colcombet, Clemens Ley

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

Computability of Data-Word Transductions over Different Data Domains by Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier

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

Comparator automata in quantitative verification by Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi

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

Reachability Problem for Weak Multi-Pushdown Automata by Wojciech Czerwiński, Piotr Hofman, SŁawomir Lasota

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

Building Specifications in the Event-B Institution by Marie Farrell, Rosemary Monahan, James F. Power

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

Exact and Approximate Determinization of Discounted-Sum Automata by Udi Boker, Thomas A. Henzinger

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