Towards Decidability of Conjugacy of Pairs and Triples

DOI10.1007/978-3-540-92701-3_16zbMath1209.68400OpenAlexW1534707114MaRDI QIDQ3601812

Benny George Kenkireth, Samrith Ram

Publication date: 12 February 2009

Published in: Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92701-3_16

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (1)

Conjugacy relations of prefix codes

Cites Work

• Unnamed Item
• Conjugacy of finite biprefix codes
• On Conjugacy of Languages
• Satisfiability of word equations with constants is in PSPACE
• Fast Pattern Matching in Strings
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Complexity of Makanin's algorithm

This page was built for publication: Towards Decidability of Conjugacy of Pairs and Triples