A complex measure for linear grammars

Ishanu Chattopadhyay, Asok Ray

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


The signed real measure of regular languages, introduced and validated in recent literature, has been the driving force for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems dealing with finite state automata (equivalently, regular languages). However, this approach relies on memoryless state-based tools for supervisory control synthesis and may become inadequate if the transitions in the plant dynamics cannot be captured by finitely many states. From this perspective, the measure of regular languages needs to be extended to that of non-regular languages, such as Petri nets or other higher level languages in the Chomsky hierarchy. Measures for non-regular languages has not apparently been reported in open literature and is an open area of research. As a step toward achieving this goal, this paper introduces a complex measure of linear context free grammars (LCFG) that belong to the class of non-regular languages. The proposed complex measure becomes equivalent to the signed real measure, reported in recent literature, if the LCFG is degenerated to a regular grammar.

Original languageEnglish (US)
Pages (from-to)761-775
Number of pages15
JournalDemonstratio Mathematica
Issue number3
StatePublished - Jul 2005

All Science Journal Classification (ASJC) codes

  • Mathematics(all)


Dive into the research topics of 'A complex measure for linear grammars'. Together they form a unique fingerprint.

Cite this