Codes and equations on trees

DOI10.1016/S0304-3975(99)00317-5zbMath0974.68095MaRDI QIDQ5941083

Antonio Restivo, Sabrina Mantaci

Publication date: 20 August 2001

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

zbMATH Keywords

tree code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (8)

Defect theorem in the plane ⋮ Unique decipherability in the monoid of languages: an application of rational relations ⋮ On extremal cases of Hopcroft's algorithm ⋮ How Many Figure Sets Are Codes? ⋮ The code problem for directed figures ⋮ DIRECTED FIGURE CODES: DECIDABILITY FRONTIER ⋮ On Extremal Cases of Hopcroft’s Algorithm ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Sur le théorème du defaut
• The undecidability of the second-order unification problem
• On the algebraic structure of rooted trees
• Periodicities on trees
• The code problem for traces -- improving the boundaries
• Minimal and complete word unification
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Codes and equations on trees