Cover Image

Unambiguous Acceptance of Thin Coalgebras

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chernev, Anton, Cîrstea, Corina, Hansen, Helle Hvid, Kupke, Clemens
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Thin Coalgebraic Behaviours Are Inductive
by: Chernev, Anton, et al.
Published: (2025)

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

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

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
by: Kiefer, Stefan, et al.
Published: (2019)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
by: Wißmann, Thorsten
Published: (2026)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
by: Yamakami, Tomoyuki
Published: (2024)

Arithmetical subword complexity of automatic sequences
by: Konieczny, Jakub, et al.
Published: (2023)

Configuration Monitor Synthesis
by: Köhl, Maximilian A., et al.
Published: (2024)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)

Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025)

Castor Ministerialis
by: Hercher, Christian
Published: (2025)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)

Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)

Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)

An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
by: Finkel, Alain, et al.
Published: (2025)

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)

FocusE: A semantic extension of FocusST
by: Spichkova, Maria
Published: (2025)

Polyregular Model Checking
by: Lopez, Aliaume, et al.
Published: (2025)

Reversible Pebble Transducers
by: Dartois, Luc, et al.
Published: (2025)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
by: Schalk, Patrizia, et al.
Published: (2025)

Higher-Dimensional Automata : Extension to Infinite Tracks
by: Passemard, Luc, et al.
Published: (2025)

Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)

Learning Event-recording Automata Passively
by: Majumdar, Anirban, et al.
Published: (2025)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
by: Akshay, S., et al.
Published: (2025)

Resolving Nondeterminism by Chance
by: Paul, Soumyajit, et al.
Published: (2025)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)