Paper Info
Title
On Conjugacy of Languages
Abstract
We say that two languages X and Y are conjugates if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated with this equation. For example, we characterize all sets which are conjugated via a two-element biprefix set Z, as well as all two-element sets which are conjugates.
Year
DOI
Venue
2001
10.1051/ita:2001130
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS
Keywords
Field
DocType
conjugacy equation,languages,Conway's problem
Discrete mathematics,Combinatorics,Boolean satisfiability problem,Conjugacy class,Free monoid,Mathematics
Journal
Volume
Issue
ISSN
35
6
0988-3754
Citations 
PageRank 
References 
5
0.67
5
Authors
3
Name
Order
Citations
PageRank
Julien Cassaigne128240.80
Juhani Karhumäki21115152.77
Ján Maňuch310918.31