On a question about factorization forests

DOI10.1016/0304-3975(94)00209-2MaRDI QIDQ673794zbMATH OpenOpenAlexFDO

Authors Giuseppe Pirillo, J. Justin

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(94)00209-2

zbMATH Keywords

strongly Ramseyan functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3873610 (Why is no real title available?)
• scientific article; zbMATH DE number 475428 (Why is no real title available?)
• Factorization forests of finite height
• On difference sets of sequences of integers. III
• Poincaré recurrence and number theory
• Shirshov's theorem and \(\omega\)-permutability of semigroups
• Two combinatorial properties of partitions of the free semigroup into finitely many parts

Cited in

(1)

• Factorization Forests

This page was built for publication: On a question about factorization forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673794)