Image de couverture de livre

Thin Coalgebraic Behaviours Are Inductive

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chernev, Anton, Cîrstea, Corina, Hansen, Helle Hvid, Kupke, Clemens
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Unambiguous Acceptance of Thin Coalgebras
par: Chernev, Anton, et autres
Publié: (2025)

Dual Adjunction Between $Ω$-Automata and Wilke Algebra Quotients
par: Chernev, Anton, et autres
Publié: (2024)

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

Tree Automata Acceptance up to Measurable Defect
par: Moyasari, Anita, et autres
Publié: (2026)

Imposing Rules in Process Discovery: an Inductive Mining Approach
par: Norouzifar, Ali, et autres
Publié: (2024)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
par: Stan, Daniel, et autres
Publié: (2026)

Arithmetical subword complexity of automatic sequences
par: Konieczny, Jakub, et autres
Publié: (2023)

Configuration Monitor Synthesis
par: Köhl, Maximilian A., et autres
Publié: (2024)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
par: Bozga, Marius, et autres
Publié: (2023)

A General Information Extraction Framework Based on Formal Languages
par: Schmid, Markus L.
Publié: (2025)

Statistical process discovery
par: Cry, Pierre, et autres
Publié: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
par: Jeppson, Joshua, et autres
Publié: (2025)

Hyper pattern matching
par: Waga, Masaki, et autres
Publié: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
par: Kutrib, Martin, et autres
Publié: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
par: Kan, Shuanglong, et autres
Publié: (2025)

Componentwise Automata Learning for System Integration (Extended Version)
par: Fujinami, Hiroya, et autres
Publié: (2025)

Universality Frontier for Asynchronous Cellular Automata
par: Baburin, Ivan, et autres
Publié: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
par: Mazowiecki, Filip, et autres
Publié: (2025)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
par: Kim, Moon, et autres
Publié: (2025)

Castor Ministerialis
par: Hercher, Christian
Publié: (2025)

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

Unambiguisability and Register Minimisation of Min-Plus Models
par: Almagor, Shaull, et autres
Publié: (2025)

Passive Learning of Lattice Automata from Recurrent Neural Networks
par: Slimi, Jaouhar, et autres
Publié: (2025)

An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
par: Finkel, Alain, et autres
Publié: (2025)

Structural Abstraction and Refinement for Probabilistic Programs
par: Li, Guanyan, et autres
Publié: (2025)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)

FocusE: A semantic extension of FocusST
par: Spichkova, Maria
Publié: (2025)

Polyregular Model Checking
par: Lopez, Aliaume, et autres
Publié: (2025)

Reversible Pebble Transducers
par: Dartois, Luc, et autres
Publié: (2025)

On the Complexity of Language Membership for Probabilistic Words
par: Amarilli, Antoine, et autres
Publié: (2025)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
par: Schalk, Patrizia, et autres
Publié: (2025)

Higher-Dimensional Automata : Extension to Infinite Tracks
par: Passemard, Luc, et autres
Publié: (2025)

Counting Abstraction for the Verification of Structured Parameterized Networks
par: Bozga, Marius, et autres
Publié: (2025)

Learning Event-recording Automata Passively
par: Majumdar, Anirban, et autres
Publié: (2025)

Two-way affine automata can verify every language
par: Chen, Zeyu, et autres
Publié: (2025)

TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
par: Akshay, S., et autres
Publié: (2025)

Resolving Nondeterminism by Chance
par: Paul, Soumyajit, et autres
Publié: (2025)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
par: Yu, Qixian, et autres
Publié: (2025)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
par: Fülöp, Zoltán, et autres
Publié: (2025)