Publications of Namit Chaturvedi

All Publications

[Cha14b] Namit Chaturvedi. Toward a structure theory of regular infinitary trace languages. In ICALP 2014: 41st International Colloquium on Automata, Languages, and Programming, Part II, number 8573 in Lecture Notes in Computer Science, pages 134-145, 2014.
[ pdf | Abstract ]
[Cha14a] Namit Chaturvedi. Languages of infinite traces and deterministic asynchronous automata. Technical Report AIB-2014-04, RWTH Aachen, February 2014. Revised version.
[ pdf | http | Abstract ]
[CG14a] Namit Chaturvedi and Marcus Gelderie. Classifying regular infinitary trace langauges using word automata. In MFCS 2014: 39th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 2014. To appear.
[ Abstract ]
[CG14b] Namit Chaturvedi and Marcus Gelderie. Weak omega-Regular Trace Languages. arXiv.org, Feb 2014. CoRR abs/1402.3199.
[ pdf | http | Abstract ]
[CMDC12] N. Chaturvedi, B. Meenakshi, and A. Datta Chowdhury. A framework for decentralized access control using finite state automata. In Deepak D'Souza and Priti Shankar, editors, Modern Applications of Automata Theory, volume 2 of IISc Research Monographs Series, pages 171-191. World Scientific, May 2012.
[ http | Abstract ]
[COT12] N. Chaturvedi, J. Olschewski, and W. Thomas. Languages vs. omega-languages in regular infinite games. International Journal of Foundations of Computer Science, 23(05):985-1000, August 2012. Journal version of [COT11]. (c) 2012 World Scientific Publishing Company.
[ pdf | http | Abstract ]
[COT11] N. Chaturvedi, J. Olschewski, and W. Thomas. Languages vs. omega-languages in regular infinite games. In Giancarlo Mauri and Alberto Leporati, editors, Proceedings of the 15th International Conference on Developments in Language Theory, DLT 2011, volume 6795 of Lecture Notes in Computer Science, pages 180-191. Springer, 2011.
[ pdf | http | Abstract ]