- Interpreted Higher-Dimensional Automata for Concurrent Discrete-Event Control Dylan Bellier Gregory Faraut Yan Monier Philipp Schlehuber-Caissier Tue 31 March 2026
- Shuffles of Context-Free Languages along Regular Trajectories Corentin Barloy Michael Cadilhac Kyle Ockerlund Tue 31 March 2026
- Nominal Automata with Name Deallocation Simon Prucker Stefan Milius Lutz Schrøder Tue 31 March 2026
- Visibly Recursive Automata Kévin Dubrulle Véronique Bruyère Guillermo A. Pérez Gaetan Staquet Tue 17 March 2026
- History-Deterministic Buchi Automata are Succinct Antonio Casares Aditya Prakash K.~S. Thejaswini Sat 07 March 2026
- Reachability in VASS Extended with Integer Counters Clotilde Bizière Wojciech Czerwiński Roland Guttenberg Jérôme Leroux Vincent Michielini Łukasz Orlikowski Antoni Puch Henry Sinclair-Banks Sat 07 March 2026
- Length Generalization Bounds for Transformers Andy Yang Pascal Bergstraßer Georg Zetzsche David Chiang Anthony W. Lin Thu 05 March 2026
- Localising Stochasticity in Weighted Automata Smayan Agarwal Aalok Thakkar Tue 03 March 2026
- LeanCat: A Benchmark Suite for Formal Category Theory in Lean (Part I: 1-Categories) Rongge Xu Hui Dai Yiming Fu Jiedong Jiang Tianjiao Nie Hongwei Wang Junkai Wang Holiverse Yang Jiatong Yang Zhi-Hao Zhang Sat 28 February 2026
- Expregular functions Thomas Colcombet Nathan Lhote Pierre Ohlmann Thu 26 February 2026
- History-Constrained Systems Louwe B. Kuijer David Purser Henry Sinclair-Banks Patrick Totzke Tue 24 February 2026
- Exploring VASS Parameterised by Geometric Dimension Wojciech Czerwiński Roland Guttenberg Łukasz Orlikowski Henry Sinclair-Banks Yangluo Zheng Fri 20 February 2026
- Out-of-Order Membership to Regular Languages Antoine Amarilli Sebastien Labbe Charles Paperman Wed 18 February 2026
- An Automata-Based Approach to Games with -Automatic Preferences Véronique Bruyère Emmanuel Filiot Christophe Grandmont Jean-François Raskin Thu 12 February 2026
- Computing the Reachability Value of Posterior-Deterministic POMDPs Nathanael Fijalkow Arka Ghosh Roman Kniazev Guillermo A. Pérez Pierre Vandenhove Thu 12 February 2026
- Automata on Graph Alphabets Hugo Bazille Uli Fahrenberg Thu 12 February 2026
- Eve-positional languages: putting order into Buchi automata Olivier Idir Thu 12 February 2026
- A Complexity Bound for Determinisation of Min-Plus Weighted Automata Shaull Almagor Guy Arbel Sarai Sheinvald Thu 05 February 2026
- The complexity of downward closures of indexed languages Richard Mandel Corto Mascle Georg Zetzsche Sun 01 February 2026
- Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning Christof Løding Igor Walukiewicz Sun 01 February 2026
- Commutative algebras of series Lorenzo Clemente Sun 01 February 2026
- Variants of Higher-Dimensional Automata Hugo Bazille Jérémy Dubut Uli Fahrenberg Krzysztof Ziemiański Tue 27 January 2026
- Algebraic Characterizations of Classes of Regular Languages in DynFO Corentin Barloy Felix Tschirbs Nils Vortmeier Thomas Zeume Tue 27 January 2026
- Well-quasi-ordered classes of bounded clique-width Mael Dumas Aliaume Lopez Tue 27 January 2026
- Layered automata: A canonical model for automata over infinite words Antonio Casares Christof Løding Igor Walukiewicz Sat 24 January 2026
- A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata Kyveli Doveri Pierre Ganty B. Srivathsan Sat 24 January 2026
- From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata Mathieu Lehaut Anca Muscholl Nir Piterman Thu 22 January 2026
- Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents Peter Kostolányi Andrej Ravinger Sun 18 January 2026
- Generalised Quantifiers Based on Rabin-Mostowski Index Denis Kuperberg Damian Niwiński Paweł Parys Michał Skrzypczak Mon 12 January 2026
- A short proof of a bound on the size of finite irreducible semigroups of rational matrices Benjamin Steinberg Sat 10 January 2026
- A pumping-like lemma for languages over infinite alphabets Yoav Danieli Fri 09 January 2026
- Parameterized Verification of Quantum Circuits (Technical Report) Parosh Aziz Abdulla Yu-Fang Chen Michal Hečko Lukáš Holík Ondřej Lengál Jyun-Ao Lin Ramanathan S. Thinniyam Mon 05 January 2026
- Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata Dominik Geißler Tobias Winkler Tue 16 December 2025
- Adding Reconfiguration to Zielonka's Asynchronous Automata Mathieu Lehaut Nir Piterman Mon 15 December 2025
- Weakly-unambiguous Parikh automata and their link to holonomic series Alin Bostan Arnaud Carayol Florent Koechlin Cyril Nicaud Thu 11 December 2025
- Unambiguisability and Register Minimisation of Min-Plus Models Shaull Almagor Guy Arbel Sarai Sheinvald Thu 11 December 2025
- Bounded treewidth, multiple context-free grammars, and downward closures C. Aiswarya Pascal Baumann Prakash Saivasan Lia Schutze Georg Zetzsche Fri 05 December 2025
- General Decidability Results for Systems with Continuous Counters A.~R. Balasubramanian Matthew Hague Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Thu 27 November 2025
- The Role of Logic and Automata in Understanding Transformers Anthony W. Lin Pablo Barcelo Wed 26 November 2025
- Algebraic Closure of Matrix Sets Recognized by 1-VASS Rida Ait El Manssour Mahsa Naraghi Mahsa Shirmohammadi James Worrell Wed 26 November 2025
- Reachability in symmetric VASS Łukasz Kamiński Sławomir Lasota Sat 05 July 2025
- On the Reachability Problem for Two-Dimensional Branching VASS Clotilde Bizière Thibault Hilaire Jérôme Leroux Grégoire Sutre Sat 05 July 2025
- Approximate Problems for Finite Transducers Emmanuel Filiot Ismael Jecker Khushraj Madnani Saina Sunny Fri 25 April 2025
- Dynamic Membership for Regular Tree Languages Antoine Amarilli Corentin Barloy Louis Jachiet Charles Paperman Fri 25 April 2025
- Resolving Nondeterminism by Chance Soumyajit Paul David Purser Sven Schewe Qiyi Tang Patrick Totzke Di-De Yen Fri 25 April 2025
- Synthesising Asynchronous Automata from Fair Specifications Béatrice Bérard Benjamin Monmege B Srivathsan Arnab Sur Fri 25 April 2025
- The complexity of reachability problems in strongly connected finite automata Stefan Kiefer Andrew Ryzhikov Fri 25 April 2025
- Reachability in Geometrically d-Dimensional VASS Yuxi Fu Yangluo Zheng Qizhe Yang Fri 25 April 2025
- Languages of Boundedly-Ambiguous Vector Addition Systems with States Wojciech Czerwiński Łukasz Orlikowski Fri 25 April 2025
- Undecidability of the Emptiness Problem for Weak Models of Distributed Computing Flavio T. Principato Javier Esparza Philipp Czerner Thu 24 April 2025
- Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids Quentin Aristote Thu 24 April 2025
- Thin Coalgebraic Behaviours Are Inductive Anton Chernev Corina Cîrstea Helle Hvid Hansen Clemens Kupke Fri 11 April 2025
- PVASS Reachability is Decidable Roland Guttenberg Eren Keskin Roland Meyer Thu 10 April 2025
- The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently Karoliina Lehtinen Aditya Prakash Sat 05 April 2025
- Determinization of Min-Plus Weighted Automata is Decidable Shaull Almagor Guy Arbel Sarai Sheinvald Sat 05 April 2025
- Pseudovarieties of semigroups Jorge Almeida Sat 05 April 2025
- When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic Sebastian Maneth Helmut Seidl Sat 05 April 2025
- Algorithmic analysis of systems with affine input and polynomial state Lorenzo Clemente Thu 03 April 2025
- Polyregular Model Checking Aliaume Lopez Rafał Stefański Tue 25 March 2025
- Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs Michal Ajdarw Thu 13 March 2025
- A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity Stefan Mengel Harry Vinall-Smeeth Tue 10 December 2024
- CMSO-transducing tree-like graph decompositions Rutger Campbell Bruno Guillon Mamadou Moustapha Kanté Eun Jung Kim Noleen Köhler Tue 10 December 2024
- Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton Günter Rote Tue 10 December 2024
- A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata Semyon Petrov Alexander Okhotin Tue 10 December 2024
- Probability and Angelic Nondeterminism with Multiset Semantics Shawn Ong Stephanie Ma Dexter Kozen Tue 10 December 2024
- Formal Languages, Formally and Coinductively Dmitriy Traytel Tue 10 December 2024
- mathbbN-polyregular functions arise from well-quasi-orderings Aliaume Lopez Fri 18 October 2024
- Recognizability of the support of recognizable series over the semiring of the integers is undecidable D. Kirsten K. Quaas Tue 15 August 2023
- On solving cycle-free context-free grammar equivalence problem using numerical analysis José João Almeida Eliana Grande Georgi Smirnov Fri 09 June 2023
- Multitree automata that count Denis Lugiez Fri 03 March 2023
- Complementing two-way finite automata Viliam Geffert Carlo Mereghetti Giovanni Pighizzini Thu 26 January 2023
- Tight bounds for reachability problems on one-counter and pushdown systems Jakob Cetti Hansen Adam Husted Kjelstrøm Andreas Pavlogiannis Thu 29 April 2021
- Complexity of weak acceptance conditions in tree automata Jakub Neumann Andrzej Szepietowski Igor Walukiewicz Fri 07 February 2020
- Timed recursive state machines: Expressiveness and complexity Massimo Benerecetti Adriano Peron Wed 30 May 2018
- Analogical Conception of Chomsky Normal Form and Greibach Normal Form for Linear, Monadic Context-Free Tree Grammars Akio Fujiyoshi Fri 04 March 2016
- A new algorithm for testing if a regular language is locally threshold testable Mikołaj Bojańczyk Fri 29 January 2016
- Separability of Rational Relations in A^* times mathbb N^m by Recognizable Relations is Decidable Christian Choffrut Serge Grigorieff Mon 25 January 2016
- Unboundedness and Downward Closures of Higher-order Pushdown Automata Matthew Hague Jonathan Kochems C.-H. Luke Ong Sat 16 January 2016
- A note on decision problems for three-way two-dimensional finite automata Katsushi Inoue Itsuo Takanami Wed 22 April 2015
- Left-most Derivation and Shadow-pushdown Automata for Context-sensitive Languages Benedek Nagy Mon 24 February 2014
- On the Complexity of a Problem on Monadic String Rewriting Systems Ferucio Laurenţiu Ţiplea Erkki Makinen Wed 19 February 2014
- Complementing Unary Nondeterministic Automata Filippo Mera Giovanni Pighizzini Thu 23 January 2014
- Unary Finite Automata vs. Arithmetic Progressions Anthony Widjaja To Thu 23 January 2014
- Factorisation Forests for Infinite Words Application to Countable Scattered Linear Orderings Thomas Colcombet Wed 08 January 2014
- Parsing with derivatives: a functional pearl Matthew Might David Darais Daniel Spiewak Thu 13 June 2013
- History-deterministic Parikh Automata Enzo Erlich Shibashis Guha Ismaël Jecker Karoliina Lehtinen Martin Zimmermann Fri 02 March 2012
- Parikh Automata on Infinite Words Mario Grobler Leif Sabellek Sebastian Siebertz Fri 02 March 2012
Library Size: 13G (87 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
