Intricacies of Simple Word Equations: an Example
暂无分享,去创建一个
[1] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[2] M. Lothaire. Algebraic Combinatorics on Words , 2002 .
[3] Karel Culik,et al. On the Equality Sets for Homomorphisms on Free Monoids with Two Generators , 1980, RAIRO Theor. Informatics Appl..
[4] Zoltán Fülöp,et al. Developments in Language Theory , 2003, Lecture Notes in Computer Science.
[5] Ju. V. Matijasevic,et al. ENUMERABLE SETS ARE DIOPHANTINE , 2003 .
[6] M. Bennett. The Equation a M = b N c P in a Free Semigroup , 2003 .
[7] Tero Harju,et al. The Equation xi = yjzk in a Free Semigroup , 2004 .
[8] Stepan Holub. A Unique Structure of Two-Generated Binary Equality Sets , 2002, Developments in Language Theory.
[9] André Lentin. Equations in Free Monoids , 1972, ICALP.
[10] Christian Choffrut,et al. Combinatorics of Words , 1997, Handbook of Formal Languages.
[11] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .
[12] M. Lothaire. Makanin's Algorithm , 2002 .