Imagen de Portada

Star Complexity of Parikh Images of Languages over Infinite Alphabets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Danieli, Yoav
Formato:	Preprint
Publicado:	2026
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

A pumping-like lemma for languages over infinite alphabets
por: Danieli, Yoav
Publicado: (2025)

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

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

Non-Global Parikh Tree Automata
por: Herrmann, Luisa, et al.
Publicado: (2024)

Parikh Automata on Finite and Infinite Words
por: Grobler, Mario, et al.
Publicado: (2023)

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

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

Reversible Transducers over Infinite Words
por: Dartois, Luc, et al.
Publicado: (2024)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
por: Rigo, Michel, et al.
Publicado: (2024)

Attractors of Parikh mapping iterations
por: Chunikhin, Alexander
Publicado: (2024)

Parikh's Theorem Made Symbolic
por: Hague, Matthew, et al.
Publicado: (2023)

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

Measure-Theoretic Aspects of Star-Free and Group Languages
por: Sin'ya, Ryoma, et al.
Publicado: (2025)

Higher-Dimensional Automata : Extension to Infinite Tracks
por: Passemard, Luc, et al.
Publicado: (2025)

Infinite-state Games with Energy Objectives Beyond Counters
por: Sağlam, Irmak, et al.
Publicado: (2026)

Measure Many Quantum Finite Automata on Infinite Words
por: Midya, Abhisek, et al.
Publicado: (2026)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
por: Nogami, Taisei, et al.
Publicado: (2024)

On the Complexity of Language Membership for Probabilistic Words
por: Amarilli, Antoine, et al.
Publicado: (2025)

Operational State Complexity of Block Languages
por: Duarte, Guilherme, et al.
Publicado: (2024)

On the Representation and State Complexity of Block Languages
por: Duarte, Guilherme, et al.
Publicado: (2024)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
por: Becker, Ruben, et al.
Publicado: (2024)

The Complexity of Aggregates over Extractions by Regular Expressions
por: Doleschal, Johannes, et al.
Publicado: (2020)

A Detailed Account of Compositional Automata Learning through Alphabet Refinement
por: Henry, Leo, et al.
Publicado: (2025)

Computational Complexity of Alignments
por: Schwanen, Christopher T., et al.
Publicado: (2026)

Decision Questions for Probabilistic Automata on Small Alphabets
por: Bell, Paul C., et al.
Publicado: (2021)

Descriptional Complexity of Finite Automata -- Selected Highlights
por: Salomaa, Arto, et al.
Publicado: (2023)

Minimizing Cost Register Automata over a Field
por: Benalioua, Yahia Idriss, et al.
Publicado: (2023)

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

Learning Weighted Automata over Number Rings, Concretely and Categorically
por: Aristote, Quentin, et al.
Publicado: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
por: Li, Elaine, et al.
Publicado: (2024)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
por: Almagor, Shaull, et al.
Publicado: (2026)

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

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
por: Kostolányi, Peter, et al.
Publicado: (2026)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
por: Wehar, Michael
Publicado: (2025)

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

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
por: Schalk, Patrizia, et al.
Publicado: (2025)

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)

Universally Wheeler Languages
por: Becker, Ruben, et al.
Publicado: (2025)

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

Positive Varieties of Lattice Languages
por: Inoue, Yusuke, et al.
Publicado: (2025)