Imagen de Portada

All about unambiguous polynomial closure

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Place, Thomas, Zeitoun, Marc
Formato:	Preprint
Publicado:	2022
Materias:	Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Navigational hierarchies of regular languages
por: Place, Thomas, et al.
Publicado: (2024)

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

Automata for the commutative closure of regular sets
por: Becher, Verónica, et al.
Publicado: (2025)

Bounded treewidth, multiple context-free grammars, and downward closures
por: Aiswarya, C., et al.
Publicado: (2025)

Two or three things I know about tree transducers
por: Nguyên, Lê Thành Dũng
Publicado: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
por: Petrov, Semyon, 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)

Weakly-unambiguous Parikh automata and their link to holonomic series
por: Bostan, Alin, et al.
Publicado: (2025)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
por: Kiefer, Stefan, et al.
Publicado: (2025)

Deciding Subtyping for Asynchronous Multiparty Sessions
por: Li, Elaine, et al.
Publicado: (2024)

Cost Automata, Safe Schemes, and Downward Closures
por: Barozzini, David, et al.
Publicado: (2020)

Do CFLOBDDs Actually Make Use of Linear Structure?
por: Sistla, Meghana Aparna, et al.
Publicado: (2026)

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

Safety and Liveness of Quantitative Properties and Automata
por: Boker, Udi, et al.
Publicado: (2023)

Quantitative Language Automata
por: Henzinger, Thomas A., et al.
Publicado: (2025)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
por: Fränzle, Martin, et al.
Publicado: (2024)

Time for Timed Monitorability
por: Grosen, Thomas M., et al.
Publicado: (2025)

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

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
por: Cimatti, Alessandro, et al.
Publicado: (2024)

WEX: Formal Specifications for Windows in Stream Processing
por: Hitarth, S, et al.
Publicado: (2022)

Correctness Notions for Petri Nets with Identifiers
por: van der Werf, Jan Martijn E. M., et al.
Publicado: (2022)

Structural Reductions and Stutter Sensitive Properties
por: Paviot-Adet, Emmanuel, et al.
Publicado: (2022)

Finite maximal codes and factorizations of cyclic groups
por: De Felice, Clelia
Publicado: (2022)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
por: Angluin, Dana, et al.
Publicado: (2022)

History-deterministic Parikh Automata
por: Erlich, Enzo, et al.
Publicado: (2022)

The Power-Set Construction for Tree Algebras
por: Blumensath, Achim
Publicado: (2022)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
por: Ferens, Robert, et al.
Publicado: (2022)

Minimality Notions via Factorization Systems and Examples
por: Wißmann, Thorsten
Publicado: (2022)

Weighted Tree Automata -- May it be a little more?
por: Fülöp, Zoltán, et al.
Publicado: (2022)

Composing Copyless Streaming String Transducers
por: Alur, Rajeev, et al.
Publicado: (2022)

Binary codes that do not preserve primitivity
por: Holub, Štěpán, et al.
Publicado: (2022)

Waiting Nets: State Classes and Taxonomy
por: Hélouët, Loïc, et al.
Publicado: (2022)

A Regular and Complete Notion of Delay for Streaming String Transducers
por: Filiot, Emmanuel, et al.
Publicado: (2022)

Simulations for Event-Clock Automata
por: Akshay, S, et al.
Publicado: (2022)

Deterministic pushdown automata can compress some normal sequences
por: Carton, Olivier, et al.
Publicado: (2022)

Standard Automata Theory and Process Algebra
por: Yodaiken, Victor
Publicado: (2022)

A model of actors and grey failures
por: Bocchi, Laura, et al.
Publicado: (2022)

Myhill-Nerode Theorem for Higher-Dimensional Automata
por: Fahrenberg, Uli, et al.
Publicado: (2022)

The Expansion Problem for Infinite Trees
por: Blumensath, Achim
Publicado: (2023)

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