Star Complexity of Parikh Images of Languages over Infinite Alphabets
cs.FL
Submitted: 2026-05-10
Updated: 2026-11-19
Related papers
- Quantitative Verification of Infinite-State Networks
- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
- Positive-Data Learning of Fixed-Observation Linear MCFGs from Working Binary Presentations
- On the Separability Problem of VASS Reachability Languages
- Exact Accepting-State Spectrum for Reversal of Permutation Automata
- An exact compress-with-another threshold in a binary automaton family