Crossref
Deciding reachability in automata on words indexed by the reals and rationals
Theoretical Computer Science · 2026-07 · 1080 · 116048
DOI: 10.1016/j.tcs.2026.116048 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Bernard Boigelot und 2 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Gefördert von: Fund for Scientific Research.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Fund for Scientific Research
Zitieren
APA
Boigelot, B., Fontaine, P., & Vergain, B. (2026). Deciding reachability in automata on words indexed by the reals and rationals. Theoretical Computer Science, 1080, 116048. https://doi.org/10.1016/j.tcs.2026.116048
Vancouver
Boigelot B, Fontaine P, Vergain B. Deciding reachability in automata on words indexed by the reals and rationals. Theoretical Computer Science. 2026;1080:116048. doi:10.1016/j.tcs.2026.116048
BibTeX
@article{Boigelot2026,
author = {Boigelot, Bernard and Fontaine, Pascal and Vergain, Baptiste},
title = {Deciding reachability in automata on words indexed by the reals and rationals},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1080},
pages = {116048},
doi = {10.1016/j.tcs.2026.116048}
}
EUVIMED