Automata and game theoretic models of computation

Autor: Gandhi, Aniruddh

In this thesis we investigate two finite state models of computation: automata and games on graphs. First we investigate the state complexity of finite word and tree automata from two directions. One direction is to study the interplay between non-de

Externí odkaz: http://hdl.handle.net/2292/19427

Efficient Algorithms for Games Played on Trees with Back-edges.

Autor: Gandhi, Aniruddh¹, Khoussainov, Bakhadyr¹, Liu, Jiamou²

Publikováno v: Fundamenta Informaticae. 2011, Vol. 111 Issue 4, p391-412. 22p.

Finite Automata over Structures.

Autor: Gandhi, Aniruddh, Khoussainov, Bakhadyr, Liu, Jiamou

Publikováno v: Theory & Applications of Models of Computation (9783642299513); 2012, p373-384, 12p

Oral Streptococcus mutans load among Indian children with cerebral palsy.

Autor: Gandhi A; Department of Dentistry, Late Shri Atal Bihari Vajpayee Memorial Government Medical College, Rajnandgaon, Chhattisgarh, India., Sonkesriya S; Department of prosthodontics Government College of Dentistry Indore, M.P., India., Roy S; Department of Orthodontics and Dentofacial Orthopedics, Hazaribagh College of Dental Sciences and Hospital, Hazaribagh, Jharkhand, India., Mishra R; Department of Conservative Dentistry and Endodontics Sharda School of Dental Sciences, Sharda University, Knowledge Park III, Greater Noida, Uttar Pradesh, India., Arora J; Clinical Practionner in Mumbai, Maharashtra, India., Soni V; Department of Periodontology and Oral Implantology, Daswani Dental College and Research Centre, Ranpur, Kota, Rajasthan, India.

Publikováno v: Bioinformation [Bioinformation] 2023 Feb 28; Vol. 19 (2), pp. 215-220. Date of Electronic Publication: 2023 Feb 28 (Print Publication: 2023).