Special factors and uniqueness conditions in rational trees

DOI10.1007/S00224-001-1006-6zbMath0984.68116OpenAlexW2051046063MaRDI QIDQ5949574

Aldo De Luca, Stefano Varricchio, Arturo Carpi

Publication date: 5 May 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1006-6

zbMATH Keywords

automata equivalencespecial factor of a word

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items (6)

Tree shift topological entropy ⋮ On extremal cases of Hopcroft's algorithm ⋮ Sturmian trees ⋮ Stefano Varricchio (1960-2008) ⋮ On Extremal Cases of Hopcroft’s Algorithm ⋮ Semiperiodic words and root-conjugacy.

This page was built for publication: Special factors and uniqueness conditions in rational trees