Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Ravikumar, Bala"'
We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$. We show that the languages accepted by unambiguous nonde
Externí odkaz:
http://arxiv.org/abs/1903.03504
Autor:
Ibarra, Oscar H., Ravikumar, Bala
Publikováno v:
In Information and Computation February 2016 246:30-42
Publikováno v:
In Theoretical Computer Science 2009 410(24):2431-2441
Publikováno v:
In Theoretical Computer Science 2009 410(24):2401-2409
Publikováno v:
In Theoretical Computer Science 2008 409(3):417-431
Autor:
Ibarra, Oscar H., Ravikumar, Bala
Publikováno v:
In Theoretical Computer Science 2006 356(1):190-199
Autor:
Eisman, Gerry1, Ravikumar, Bala2
Publikováno v:
Fundamenta Informaticae. 2011, Vol. 110 Issue 1-4, p125-142. 18p. 1 Graph.
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objective is the utilization of existing services to respond to new business re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e6a5c9b1c5b2753df16ce57ef8b4e8e