:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Nguyên, Lê Thành Dũng
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory
Acceso en línea:	https://arxiv.org/abs/2409.03169
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The structure of polynomial growth for tree automata/transducers and MSO set queries
por: Gallot, Paul, et al.
Publicado: (2025)

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
por: Dartois, Luc, et al.
Publicado: (2026)

Slightly Non-Linear Higher-Order Tree Transducers
por: Nguyên, Lê Thành Dũng, et al.
Publicado: (2024)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
por: Moreau, Vincent, et al.
Publicado: (2023)

Function spaces for orbit-finite sets
por: Bojańczyk, Mikołaj, et al.
Publicado: (2024)

Soft state reduction of fuzzy automata over residuated lattices
por: Nguyen, Linh Anh, et al.
Publicado: (2025)

All about unambiguous polynomial closure
por: Place, Thomas, et al.
Publicado: (2022)

Dot-depth three, return of the J-class
por: Place, Thomas, et al.
Publicado: (2024)

Computing measures of weak-MSO definable sets of trees
por: Niwiński, Damian, et al.
Publicado: (2024)

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

CMSO-transducing tree-like graph decompositions
por: Campbell, Rutger, et al.
Publicado: (2024)

Two-Way One-Counter Nets Revisited
por: Almagor, Shaull, et al.
Publicado: (2024)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
por: Fülöp, Zoltán, et al.
Publicado: (2025)

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

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

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

Efficient Interaction-Based Offline Runtime Verification of Distributed Systems with Lifeline Removal
por: Mahe, Erwan, et al.
Publicado: (2024)

Statistical process discovery
por: Cry, Pierre, et al.
Publicado: (2025)

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

Automated generation of attack trees with optimal shape and labelling
por: Gadyatskaya, Olga, et al.
Publicado: (2023)

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

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
por: Akshay, S., et al.
Publicado: (2024)

A Formal Approach for Tuning Stochastic Oscillators
por: Ballarini, Paolo, et al.
Publicado: (2024)

A Tree Sampler for Bounded Context-Free Languages
por: Considine, Breandan
Publicado: (2024)

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

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
por: Acharya, Rohan, et al.
Publicado: (2024)

Characterization of Isometric Words based on Swap and Mismatch Distance
por: Anselmo, M., et al.
Publicado: (2024)

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
por: Pert, Charles, et al.
Publicado: (2024)

Deterministic Parikh automata on infinite words
por: Grobler, Mario, et al.
Publicado: (2024)

Information-flow Interfaces and Security Lattices
por: Bartocci, Ezio, et al.
Publicado: (2024)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
por: Raskin, Jean-François, et al.
Publicado: (2024)

5' -> 3' Watson-Crick Automata accepting Necklaces
por: Nagy, Benedek
Publicado: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
por: Bizière, Clotilde, et al.
Publicado: (2024)

The complexity of separability for semilinear sets and Parikh automata
por: Collins, Elias Rojas, et al.
Publicado: (2024)

QuAK: Quantitative Automata Kit
por: Chalupa, Marek, et al.
Publicado: (2024)

Development of parallel programs on shared data-structures -- Revised version
por: Stølen, Ketil
Publicado: (2024)

Exact descriptional complexity of determinization of input-driven pushdown automata
por: Martynova, Olga
Publicado: (2024)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
por: Aristote, Quentin
Publicado: (2024)

Extended time Petri nets
por: Radom, Marcin, et al.
Publicado: (2024)

A short survey around the pumping lemma for context-free languages
por: Gullà, Gabriele
Publicado: (2024)