:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Boqi, Marussy, Kristóf, Semeráth, Oszkár, Mussbacher, Gunter, Varró, Dániel
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Formal Languages and Automata Theory
Acceso en línea:	https://arxiv.org/abs/2405.08645
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Proceedings 16th International Workshop on Graph Computation Models
por: Lambers, Leen, et al.
Publicado: (2026)

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

Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
por: Tsai, Yun Chen, et al.
Publicado: (2025)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
por: Iosif, Radu, et al.
Publicado: (2025)

Interpreted Higher-Dimensional Automata for Concurrent Discrete-Event Control
por: Bellier, Dylan, et al.
Publicado: (2026)

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
por: Drewes, Frank, et al.
Publicado: (2025)

Automata on Graph Alphabets
por: Bazille, Hugo, et al.
Publicado: (2026)

A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
por: Dhayalkar, Sahil Rajesh
Publicado: (2025)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Regular Grammars for Sets of Graphs of Tree-Width 2
por: Bozga, Marius, et al.
Publicado: (2024)

Robust MITL planning under uncertain navigation times
por: Linard, Alexis, et al.
Publicado: (2024)

Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
por: Yang, Yunhao, et al.
Publicado: (2025)

Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
por: Drabik, Karolina, et al.
Publicado: (2025)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
por: Gómez-Martínez, Elena, et al.
Publicado: (2026)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
por: Shoudai, Takayoshi, et al.
Publicado: (2026)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
por: Nepeivoda, Antonina, et al.
Publicado: (2025)

Networks of Moore Machines
por: Yodaiken, Victor
Publicado: (2015)

Extracting Robust Register Automata from Neural Networks over Data Sequences
por: Hong, Chih-Duo, et al.
Publicado: (2025)

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
por: Latif, Saba, et al.
Publicado: (2025)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
por: De Rosa, Mattia, et al.
Publicado: (2025)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
por: Schwartz, Daniel G.
Publicado: (2025)

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

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

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

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
por: Hausmann, Daniel, et al.
Publicado: (2024)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
por: Stan, Daniel, et al.
Publicado: (2026)

Extending AALpy with Passive Learning: A Generalized State-Merging Approach
por: von Berg, Benjamin, et al.
Publicado: (2025)

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
por: Kuriyama, Takayuki
Publicado: (2026)

Deconstructing Subset Construction -- Reducing While Determinizing
por: Nicol, John, et al.
Publicado: (2025)

Learning Reward Machines from Partially Observed Policies
por: Shehab, Mohamad Louai, et al.
Publicado: (2025)

Transformers as Transducers
por: Strobl, Lena, et al.
Publicado: (2024)

Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
por: Li, Tian, et al.
Publicado: (2025)

Active Learning of Symbolic Automata Over Rational Numbers
por: Hagedorn, Sebastian, et al.
Publicado: (2025)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
por: Dumitru, Radu Cosmin, et al.
Publicado: (2026)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
por: Okudono, Takamasa, et al.
Publicado: (2024)

SMT-Based Active Learning of Weighted Automata
por: Ferreira, Tiago, et al.
Publicado: (2026)

Continuous Diffusion Models Can Obey Formal Syntax
por: Kim, Jinwoo, et al.
Publicado: (2026)

Unsupervised Hierarchical Skill Discovery
por: Harvey, Damion, et al.
Publicado: (2026)

PDFA Distillation via String Probability Queries
por: Baumgartner, Robert, et al.
Publicado: (2024)

Solomonoff induction
por: Sterkenburg, Tom F.
Publicado: (2026)