A complex measure for linear grammars

Demonstratio Mathematica

Volumn 38, Issue 3, 2005, Pages 761-775

  Chattopadhyay, Ishanu ^a   Ray, Asok ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Discrete event supervisory control; Language measure; Linear grammars

Indexed keywords

EID: 34047228938     PISSN: 04201213     EISSN: 23914661     Source Type: Journal    
DOI: 10.1515/dema-2005-0323     Document Type: Article

References (8)

1. I. Chattopadhyay, A. Ray, and X. Wang, A Complex Measure of Non-Regular Languages for Discrete-Event Supervisory Control, Proceedings of American Control Conference, Boston, MA (2004), pp. 5120-5125.
2. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2nd ed., Addison-Wesley, 2001.
3. J. O. Moody and P. J. Antsaklis, Supervisory Control of Discrete Event Systems Using Petri Nets, Kluwer Academic, 1998.
4. P. J. Ramadge and W. M. Wonham, Supervisory control of a class of discrete event processes, SIAM J. Control Optim. 25(1987), no. 1, 206-230.
5. A. Ray, J. Fu, and C. Lagoa, Optimal supervisory control of finite state automata, Internat. J. Control 77(2004), no. 12, 1083-1100.
6. W. Rudin, Real and Complex Analysis, 3rd ed., McGraw Hill, New York, 1988.
7. A. Surana and A. Ray, Measure of regular languages, Demonstratio Math. 37(2004), no. 2, 485-503.
8. X. Wang, A. Ray and A. Khatkhate, On-line Identification of Language Measure Parameters for Discrete Event Supervisory Control, Applied Mathematical Modelling 29(2005), no. 6, 597-613.