Sequentielle Analyse kontextfreier Sprachen

Summary

Sequential analysis of context-free languages. Since 1965 several methods to solve the word problem for context-free languages in no more than cn ³steps have been published where c is a constant and n the length of the word [2, 5, 7]. The procedure to be described is a sequential procedure that means that the word which is to be analyzed has to be read monotonic from left to right and that the word problem is decided for each partial word. The method consists in constructing a “growing” automaton whose wiring (in a physical way of speaking) grows only quadratically. From a monotonicity of property of signal propagation in our automata we can conclude that the procedure can be implemented on a RAM (random access machine) in such a way that the word problem is decided in at most cn ³steps.