Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/420439
Full metadata record
DC FieldValueLanguage
dc.coverage.spatialComputer Science and Engineering
dc.date.accessioned2022-11-25T04:52:59Z-
dc.date.available2022-11-25T04:52:59Z-
dc.identifier.urihttp://hdl.handle.net/10603/420439-
dc.description.abstractIn 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
dc.format.extentNot Available
dc.languageEnglish
dc.relationNot Available
dc.rightsself
dc.titlePatterns pattern avoidance and graphs on words
dc.title.alternativeNot available
dc.creator.researcherSingh, Mrityunjay
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Artificial Intelligence
dc.subject.keywordEngineering and Technology
dc.description.noteNot Available
dc.contributor.guideKenkireth, Benny George
dc.publisher.placeGuwahati
dc.publisher.universityIndian Institute of Technology Guwahati
dc.publisher.institutionDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
dc.date.registered2010
dc.date.completed2019
dc.date.awarded2019
dc.format.dimensionsNot Available
dc.format.accompanyingmaterialNone
dc.source.universityUniversity
dc.type.degreePh.D.
Appears in Departments:Department of Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
01_fulltext.pdfAttached File853.77 kBAdobe PDFView/Open
04_abstract.pdf221.24 kBAdobe PDFView/Open
80_recommendation.pdf280.25 kBAdobe PDFView/Open


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: