EUVIMEDEUVIMED entdecken
Crossref

Improved bounds on the length of shortest strings accepted by two-way finite automata

Olga Martynova, Alexander Okhotin

Information and Computation · 2026-06 · 311 · 105462

DOI: 10.1016/j.ic.2026.105462 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Information and Computation, 2026-06. Verfasst von Olga Martynova und 1 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Gefördert von: Russian Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Russian Science Foundation

Zitieren

APA

Martynova, O., & Okhotin, A. (2026). Improved bounds on the length of shortest strings accepted by two-way finite automata. Information and Computation, 311, 105462. https://doi.org/10.1016/j.ic.2026.105462

Vancouver

Martynova O, Okhotin A. Improved bounds on the length of shortest strings accepted by two-way finite automata. Information and Computation. 2026;311:105462. doi:10.1016/j.ic.2026.105462

BibTeX
@article{Martynova2026,
  author = {Martynova, Olga and Okhotin, Alexander},
  title = {Improved bounds on the length of shortest strings accepted by two-way finite automata},
  journal = {Information and Computation},
  year = {2026},
  volume = {311},
  pages = {105462},
  doi = {10.1016/j.ic.2026.105462}
}
Kostenlos starten →