Cover Image

Complete Test Suites for Automata in Monoidal Closed Categories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kocsis, Bálint, Rot, Jurriaan
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Rerailing Automata
by: Ehlers, Rüdiger
Published: (2025)

Intersecting Dense Automata
by: Chistikov, Dmitry, et al.
Published: (2026)

On Good-for-MDPs Automata
by: Schewe, Sven, et al.
Published: (2022)

Automata on $S$-adic words
by: Berthé, Valérie, et al.
Published: (2025)

Inferring Symbolic Automata
by: Fisman, Dana, et al.
Published: (2021)

Quantitative Semantics for Jumping Automata
by: Almagor, Shaull, et al.
Published: (2024)

Variants of Higher-Dimensional Automata
by: Bazille, Hugo, et al.
Published: (2026)

History-deterministic Timed Automata
by: Bose, Sougata, et al.
Published: (2023)

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)

Arbitrary-arity Tree Automata and QCTL
by: Laroussinie, François, et al.
Published: (2024)

Bisimulations and Logics for Higher-Dimensional Automata
by: Zouari, Safa, et al.
Published: (2024)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Knowledge Compilation for Quantification in Alternating Automata
by: Akshay, S., et al.
Published: (2026)

Random Deterministic Automata With One Added Transition
by: Carayol, Arnaud, et al.
Published: (2024)

Unknown Biases and Timing Constraints in Timed Automata
by: Haase, Darion, et al.
Published: (2024)

Complementation of Emerson-Lei Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2024)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2026)

Feasability of Learning Weighted Automata on a Semiring
by: Daviaud, Laure, et al.
Published: (2023)

Discounted-Sum Automata with Multiple Discount Factors
by: Boker, Udi, et al.
Published: (2023)

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

Automating the Analysis of Quantitative Automata with QuAK
by: Chalupa, Marek, et al.
Published: (2025)

Extending QuAK with Nested Quantitative Automata
by: Henzinger, Thomas A., et al.
Published: (2026)

Tree Automata Acceptance up to Measurable Defect
by: Moyasari, Anita, et al.
Published: (2026)

Characterizing the Polynomial-Time Minimizable $ω$-Automata
by: Radi, Bader Abu, et al.
Published: (2025)

Higher-Dimensional Timed Automata for Real-Time Concurrency
by: Amrane, Amazigh, et al.
Published: (2024)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)

Automata-less Monitoring via Trace-Checking (Extended Version)
by: Brunello, Andrea, et al.
Published: (2025)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
by: Takata, Yoshiaki, et al.
Published: (2024)

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
by: Doveri, Kyveli, et al.
Published: (2026)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)