We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
Engaging in a secondary task, such as dialing a cell phone, while driving a car has been found to have a deleterious effect on driver performance. A point often overlooked though ...
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...