- The memory of ømega-regular and BC(Sigma2^0) objectives Antonio Casares Pierre Ohlmann Fri 14 March 2025
- Membership Problems in Finite Groups Markus Lohrey Andreas Rosowski Georg Zetzsche Sun 09 March 2025
- Nondeterministic tree-walking automata are not closed under complementation Olga Martynova Alexander Okhotin Tue 18 February 2025
- 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
- Bounded languages described by GF(2)-grammars Vladislav Makarov Fri 29 November 2024
- mathbbN-polyregular functions arise from well-quasi-orderings Aliaume Lopez Fri 18 October 2024
- Presheaf automata Georg Struth Krzysztof Ziemiański Sat 12 October 2024
- An automata-based approach for synchronizable mailbox communication Romain Delpy Anca Mushcoll Grégoire Sutre Thu 11 July 2024
- Learning Closed Signal Flow Graphs Ekaterina Piotrovskaya Leo Lobski Fabio Zanasi Thu 04 July 2024
- The Complexity of Simplifying ømega-Automata through the Alternating Cycle Decomposition Antonio Casares Corto Mascle Mon 01 July 2024
- Computing the Bandwidth of Meager Timed Automata Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclán Sun 23 June 2024
- Linear equations and recursively enumerable sets Juha Honkala Fri 07 June 2024
- Nominal Tree Automata With Name Allocation Simon Prucker Lutz Schrøder Tue 28 May 2024
- Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages Bharat Adsul Paul Gastin Shantanu Kulkarni Pascal Weil Wed 22 May 2024
- Mahler equations for Zeckendorf numeration Olivier Carton Reem Yassawi Thu 09 May 2024
- Functional Closure Properties of Finite mathbbN-weighted Automata Julian Dørfler Christian Ikenmeyer Wed 24 April 2024
- Implicit automata in łambda-calculi III: affine planar string-to-string functions Cécilia Pradic Ian Price Thu 18 April 2024
- Half-positional ømega-regular languages Antonio Casares Pierre Ohlmann Thu 01 February 2024
- Simulation vs. Equivalence Zoltan Esik Andreas Maletti Mon 13 November 2023
- A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages Frits Vaandrager Abhisek Midya Mon 06 November 2023
- Bandwidth of Timed Automata: 3 Classes Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclan Thu 05 October 2023
- Learning from Positive and Negative Examples: New Proof for Binary Alphabets Jonas Lingg Mateus de Oliveira Oliveira Petra Wolf Wed 04 October 2023
- Coordination Sequences of Periodic Structures are Rational via Automata Theory Eryk Kopczynski Thu 03 August 2023
- Positive Data Languages Florian Frank Stefan Milius Henning Urbat Sat 29 April 2023
- Quantitative estimates for the size of an intersection of sparse automatic sets Seda Albayrak Jason Bell Fri 28 April 2023
- Languages given by Finite Automata over the Unary Alphabet Gordon Hoi Sanjay Jain Frank Stephan Christopher Tan Mon 20 February 2023
- Automata and one-dimensional TQFTs with defects Paul Gustafson Mee Seong Im Remy Kaldawy Mikhail Khovanov Zachary Lihn Sat 07 January 2023
- Decision Questions for Probabilistic Automata on Small Alphabets Paul C. Bell Pavel Semukhin Wed 29 June 2022
- Simulations of Weighted Tree Automata Zoltán Ésik Andreas Maletti Fri 20 May 2022
- On the size of good-for-games Rabin automata and its link with the memory in Muller games Antonio Casares Thomas Colcombet Karoliina Lehtinen Wed 27 April 2022
- A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations Clemens Heuberger Daniel Krenn Gabriel F. Lipnik Fri 04 February 2022
- Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines Bruno Guillon Giovanni Pighizzini Luca Prigioniero Daniel Průša Wed 10 March 2021
- On is an n-MCFL Kilian Gebhardt Frédéric Meunier Sylvain Salvati Sun 27 December 2020
- Ambiguity Hierarchy of Regular Infinite Tree Languages Alexander Rabinovich Doron Tiferet Sat 12 September 2020
- Implicit automata in typed łambda-calculi II: streaming transducers vs categorical semantics Nguyên Thành Dũng Lê Camille Noûs Pierre Pradic Tue 04 August 2020
- Detectability of labeled weighted (max-plus) automata Kuize Zhang Fri 26 June 2020
- Synchronization of Deterministic Visibly Push-Down Automata Henning Fernau Petra Wolf Wed 13 May 2020
- Synchronizing Deterministic Push-Down Automata Can Be Really Hard Henning Fernau Petra Wolf Tomoyuki Yamakami Wed 13 May 2020
- Minimising Good-for-Games automata is NP complete Sven Schewe Sun 29 March 2020
- Minimization of visibly pushdown automata is NP-complete Olivier Gauwin Anca Muscholl Michael Raskin Wed 24 July 2019
- The Krohn-Rhodes Theorem and Local Divisors V. Diekert M. Kufleitner B. Steinberg Fri 16 November 2018
- A Characterization for Decidable Separability by Piecewise Testable Languages Wojciech Czerwiński Wim Martens Lorijn van Rooijen Marc Zeitoun Georg Zetzsche Mon 12 November 2018
Library Size: 13G (42 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
