Imagen de Portada

Tree Automata Acceptance up to Measurable Defect

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Moyasari, Anita, Beohar, Harsh, Grellois, Charles, Kupke, Clemens
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Rerailing Automata
por: Ehlers, Rüdiger
Publicado: (2025)

Intersecting Dense Automata
por: Chistikov, Dmitry, et al.
Publicado: (2026)

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

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

Inferring Symbolic Automata
por: Fisman, Dana, et al.
Publicado: (2021)

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

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

Quantitative Semantics for Jumping Automata
por: Almagor, Shaull, et al.
Publicado: (2024)

History-deterministic Timed Automata
por: Bose, Sougata, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Complete Test Suites for Automata in Monoidal Closed Categories
por: Kocsis, Bálint, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

Dual Adjunction Between $Ω$-Automata and Wilke Algebra Quotients
por: Chernev, Anton, et al.
Publicado: (2024)

Unambiguous Acceptance of Thin Coalgebras
por: Chernev, Anton, et al.
Publicado: (2025)