EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

On languages of transduced-input finite automata with translucent letters

Benedek Nagy, Madeeha Fatima

Theoretical Computer Science · 2026-09 · 1082 · 116077

DOI: 10.1016/j.tcs.2026.116077 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von Benedek Nagy und 1 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Nagy, B., & Fatima, M. (2026). On languages of transduced-input finite automata with translucent letters. Theoretical Computer Science, 1082, 116077. https://doi.org/10.1016/j.tcs.2026.116077

Vancouver

Nagy B, Fatima M. On languages of transduced-input finite automata with translucent letters. Theoretical Computer Science. 2026;1082:116077. doi:10.1016/j.tcs.2026.116077

BibTeX
@article{Nagy2026,
  author = {Nagy, Benedek and Fatima, Madeeha},
  title = {On languages of transduced-input finite automata with translucent letters},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1082},
  pages = {116077},
  doi = {10.1016/j.tcs.2026.116077}
}
Kostenlos starten →