Avoid-or-Compress Words for Reachable Images Missing Four or Five States
cs.FL, math.CO
Submitted: 2026-10-29
Updated: 2026-11-14
Comments: 13 pages, 2 figures, 1 table. Computer-assisted upper bounds
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
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