Factorisation Forests for Infinite Words

DOI10.1007/978-3-540-74240-1_20zbMath1135.68454OpenAlexW1588819891MaRDI QIDQ5444963

Thomas Colcombet

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_20

zbMATH Keywords

semigroupsautomatainfinite wordsFormal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Total orders (06A05)

Related Items (10)

Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ R-Automata ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ One-way resynchronizability of word transducers ⋮ Universality of R-automata with Value Copying ⋮ The Height of Factorization Forests ⋮ Factorization Forests ⋮ Regular transducer expressions for regular transformations ⋮ Unnamed Item ⋮ The factorisation forest theorem

This page was built for publication: Factorisation Forests for Infinite Words