On factorization forests of finite height

DOI10.1016/S0304-3975(03)00344-XzbMath1071.68038MaRDI QIDQ1884989

Jérémie Chalopin, Hing-Man Leung

Publication date: 27 October 2004

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

zbMATH Keywords

Ramseyan factorization forestSemigroup morphism

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Mappings of semigroups (20M15)

Related Items (6)

Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ A survey on the local divisor technique ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ The Height of Factorization Forests ⋮ The factorisation forest theorem

Cites Work

• Factorization forests of finite height
• An interesting combinatorial method in the theory of locally finite semigroups
• On semigroups of matrices over the tropical semiring
• Unnamed Item
• Unnamed Item

This page was built for publication: On factorization forests of finite height