Metraipolis › archive › dc_34934315fa17
Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound — arXiv:2609.13793
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13793
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:16:51.902Z
- SHA-256 of the archived text
f72472e5a9868c8948c32c7d635200b935806ecf6e8c4affdaf925d72208aca5- Stable URL of this page
https://metraipolis.com/documento/dc_34934315fa17
How to cite
Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound — arXiv:2609.13793 — arXiv (en), https://arxiv.org/abs/2609.13793 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34934315fa17 (Metraipolis archive dc_34934315fa17, sha256 f72472e5a9868c8948c32c7d635200b935806ecf6e8c4affdaf925d72208aca5)
BibTeX
@misc{dc34934315fa17,
title = {Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound — arXiv:2609.13793},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13793},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34934315fa17; sha256 f72472e5a9868c8948c32c7d635200b935806ecf6e8c4affdaf925d72208aca5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13793. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A recent result by the present authors established a quadratic lower bound, in the worst case, for the increase in the number of states when a one-way nondeterministic finite automaton is converted to a two-way deterministic finite automaton. Although this simply matched a well-known pre-existing quadratic lower bound by Chrobak, it used a distinct proof method. We show that, much like Chrobak's, this new method is also unable to deliver any lower bound strictly greater than quadratic. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in cs.FL). Categorie arXiv: Formal Languages and Automata Theory (cs.FL). Pagina del lavoro: https://arxiv.org/abs/2609.13793 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T01:56:58.263Z dalla pagina https://arxiv.org/catchup/cs.FL/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).