A new proof for the decidability of D0L ultimate periodicity

From MaRDI portal

Revision as of 16:35, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2789524

Jump to:navigation, search

DOI10.4204/EPTCS.63.20zbMath1331.68131arXiv1108.3631MaRDI QIDQ2789524

Tomi Kärki, Vesa Halava, Tero J.Harju

Publication date: 1 March 2016

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.3631

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

This page was built for publication: A new proof for the decidability of D0L ultimate periodicity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2789524&oldid=15681465"