Formal languages and their relation to automata
Formal languages and their relation to automata
Hi-index | 0.00 |
The notion of interactive languages generated by interactions between two phrase-structure grammars are proposed and discussed. It is shown that a family of context-free languages does not include a family of interactive languages between two regular grammars and vice versa. The family of interactive languages, however, is not closed under any of the ordinary operations. The paper also includes discussions about n-cyclic interactive languages among n grammars.