A Language Measure for Supervisory Control

Applied Mathematics Letters

Volumn 16, Issue 7, 2003, Pages 985-991

  Ray, A ^a   Surana, A ^a   Phoha, S ^b  

^a The Pennsylvania State University   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Discrete event systems; Finite state automata; Formal languages; Measures

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; POLYNOMIALS; VECTORS;

DISCRETE EVENT SYSTEMS;

FORMAL LANGUAGES;

EID: 0242364794     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(03)90084-X     Document Type: Article

References (5)

1. P. J. Ramadge and W.M. Wonham, Supervisory control of a class of discrete event processes, SIAM Journal of Control and Optimization 25 (1), 206-230, (1987).
2. W. Rudin, Real and Complex Analysis, Third Edition, McGraw-Hill, New York, (1988).
3. H.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Second Edition, Addison-Wesley, Reading, MA, (2001).
4. J.C. Martin, Introduction to Languages and the Theory of Computation, Second Edition, McGraw-Hill, New York, (1997).
5. V. Drobot, Formal Languages and Automata Theory, Computer Science Press, (1989).