Imagen de Portada

Attractor Basins in Concurrent Systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Samboni, Giann Karlo Aguirre, Haar, Stefan, Paulevé, Loic, Schwoon, Stefan, Würdemann, Nick
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory F.4
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Taking Complete Finite Prefixes To High Level, Symbolically
por: Würdemann, Nick, et al.
Publicado: (2023)

A Uniform Framework for Problems on Context-Free Grammars
por: Esparza, Javier, et al.
Publicado: (2024)

Algebraic Language Theory with Effects
por: Lenke, Fabian, et al.
Publicado: (2024)

The CFG Complexity of Singleton Sets
por: Fortnow, Lance, et al.
Publicado: (2024)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
por: Ibarra, Oscar H., et al.
Publicado: (2024)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
por: Udupa, Sumukha, et al.
Publicado: (2024)

Verifying Unboundedness via Amalgamation
por: Anand, Ashwani, et al.
Publicado: (2024)

Monads, Comonads, and Transducers
por: Stefański, Rafał
Publicado: (2024)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
por: Havel, Martin, et al.
Publicado: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
por: Doveri, Kyveli, et al.
Publicado: (2024)

Commuting upper triangular binary morphisms
por: Honkala, Juha
Publicado: (2023)

Active Learning Techniques for Pomset Recognizers
por: Pommellet, Adrien, et al.
Publicado: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
por: Löding, Christof, et al.
Publicado: (2025)

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

Store Languages of Turing Machines and Counter Machines
por: Friesen, Noah, et al.
Publicado: (2025)

Active Learning of Upward-Closed Sets of Words
por: Aristote, Quentin
Publicado: (2025)

Deciding DFA-Primality is NP-Hard
por: Spenner, Daniel Alexander
Publicado: (2026)

Omega-Regular Robustness
por: Fisman, Dana, et al.
Publicado: (2025)

Runtime Consultants
por: Fisman, Dana, et al.
Publicado: (2025)

Learning Realtime One-Counter Automata
por: Bruyère, Véronique, et al.
Publicado: (2021)

On History-Deterministic One-Counter Nets
por: Prakash, Keya, et al.
Publicado: (2022)

Automata with Timers
por: Bruyère, Véronique, et al.
Publicado: (2023)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
por: Hopkins, Mark, et al.
Publicado: (2023)

Secret Protection in Labeled Petri Nets
por: Haar, Stefan, et al.
Publicado: (2025)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
por: Silva, Jorge Miguel
Publicado: (2026)

Learning Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2025)

Various Types of Comet Languages and their Application in External Contextual Grammars
por: Ködding, Marvin, et al.
Publicado: (2024)

Parsing Hypergraphs using Context-Free Positional Grammars
por: Costagliola, Gennaro, et al.
Publicado: (2026)

Introducing Divergence for Infinite Probabilistic Models
por: Finkel, Alain, et al.
Publicado: (2023)

Non-reducible Modal Transition Systems
por: Basile, Davide
Publicado: (2023)

Alternating Nominal Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2024)

The single-use restriction for register automata and transducers over infinite alphabets
por: Stefański, Rafał
Publicado: (2024)

A Word Sampler for Well-Typed Functions
por: Considine, Breandan
Publicado: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
por: Löding, Christof, et al.
Publicado: (2024)

Learning real-time one-counter automata using polynomially many queries
por: Mathew, Prince, et al.
Publicado: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
por: Rote, Günter
Publicado: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
por: Rote, Günter
Publicado: (2024)

On Repetitive Finite Automata with Translucent Words
por: Mráz, František, et al.
Publicado: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
por: Löding, Christof, et al.
Publicado: (2022)

Recognizing Numbers
por: Gaba, Pranshu, et al.
Publicado: (2025)