| Type of Material: | Thesis |
| Title: | Counter automata and classical logics for data words |
| Researcher: | Amaldev, Manuel |
| Guide: | Ramanujam, R |
| Department: | Department of Mathematical Sciences |
| Publisher: | Homi Bhabha National Institute |
| Place: | Mumbai |
| Year: | October 2011 |
| Language: | English |
| Subject: | Petri nets | Mathematical science | Mathematical Sciences |
| Dissertation/Thesis Note: | PhD |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 263074 | |
| 003 | IN-AhILN | |
| 005 | 2013-12-05 09:06:19 | |
| 008 | __ | 120917t2011||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_263074 |
| 040 | __ | |aHBNI_400088|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aAmaldev, Manuel|eResearcher |
| 110 | __ | |aDepartment of Mathematical Sciences|bHomi Bhabha National Institute|dMumbai |
| 245 | __ | |aCounter automata and classical logics for data words |
| 260 | __ | |aMumbai|bHomi Bhabha National Institute|cOctober 2011 |
| 502 | __ | |bPhD |
| 518 | __ | |oDate of Notification|d2011-10 |
| 520 | __ | |aThis thesis takes shape in the ongoing study of automata and logics for data words ? finite words labelled with elements from an infinite alphabet. The notion of data words is a natural way for modelling unboundedness arising in different areas of compu |
| 650 | __ | |aMathematical Sciences|2UGC |
| 653 | __ | |aPetri nets |
| 653 | __ | |aMathematical science |
| 700 | __ | |aRamanujam, R|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/4717|yShodhganga |
| 905 | __ | |anotification |
User Feedback Comes Under This section.