Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/420439
Title: | Patterns pattern avoidance and graphs on words |
Researcher: | Singh, Mrityunjay |
Guide(s): | Kenkireth, Benny George |
Keywords: | Computer Science Computer Science Artificial Intelligence Engineering and Technology |
University: | Indian Institute of Technology Guwahati |
Completed Date: | 2019 |
Abstract: | In this thesis we look at various notions of patterns and pattern avoidance in words The three themes we have looked at are pattern avoidance on two dimensional words pattern based word representability of graph and quasiperiodicity patterns and their allied properties in Tribonacci words A mapping f from Z times Z to 206 163 is called a two dimensional word For each discrete line of a two dimensional word we can get a one dimensional word by concatenating letters present at the lattice points |
Pagination: | Not Available |
URI: | http://hdl.handle.net/10603/420439 |
Appears in Departments: | Department of Computer Science and Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_fulltext.pdf | Attached File | 853.77 kB | Adobe PDF | View/Open |
04_abstract.pdf | 221.24 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 280.25 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: