A faster algorithm for the construction of optimal factoring automata
Journal of Computer and System Sciences · 2027-03 · 164 · 103877
DOI: 10.1016/j.jcss.2026.103877 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2027-03. Verfasst von Thomas Erlebach und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Durham University.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Durham University
Zitieren
APA
Erlebach, T., & Papadopoulos, K. (2027). A faster algorithm for the construction of optimal factoring automata. Journal of Computer and System Sciences, 164, 103877. https://doi.org/10.1016/j.jcss.2026.103877
Vancouver
Erlebach T, Papadopoulos K. A faster algorithm for the construction of optimal factoring automata. Journal of Computer and System Sciences. 2027;164:103877. doi:10.1016/j.jcss.2026.103877
BibTeX
@article{Erlebach2027,
author = {Erlebach, Thomas and Papadopoulos, Kleitos},
title = {A faster algorithm for the construction of optimal factoring automata},
journal = {Journal of Computer and System Sciences},
year = {2027},
volume = {164},
pages = {103877},
doi = {10.1016/j.jcss.2026.103877}
}
EUVIMED