Home > Search Results: recid:270683
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 

(100)
Binary equality words
 Hadravová, Jana ; Stanovský, David (referee) ; Holub, Štěpán (advisor)
Binary equality language is a set consisting of all solutions of equation g(w) = h(w), where g, h are arbitrary binary morphisms. Recently, it has been prooved that equality set for each pair of morphisms g, h is generated by at most two words. Structure of binary equality language has been already known in the case that at least one of morphisms g, h is periodic or if their equality set is generated exactly by two words. The main objective of the paper was to find a structure of solutions for morphisms whose equality set is generated by one word. The problem in general case remains unsolved but special result for solutions consisting of just one block for marked morphisms was discovered. Using methods established in this paper (covering by the same pattern to find n-multiple p-overflows and working with the cyclic pair (e, f, z)) it is believed that some more results can be achieved in the near future.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English