Formal languages and their relation to automata
Formal languages and their relation to automata
Hi-index | 0.00 |
Definitions are proposed and the basic mathematical theory is developed for notions of ambiguity in the developmental systems of Lindenmayer. This preliminary work is confined to developmental systems without cellular interactions, the so-called 0L-systems. Two types of ambiguity, called surface and production ambiguity, are defined for 0L-systems. It is shown that these two definitions, taken together, are equivalent to the usual definition of ambiguity for the well-known special case of context-free grammars.