Jan 11, 1988 · An application of Mehlhorn's algorithm for bracket languages to log n space recognition of input-driven languages. Inform. Process.

Input-driven languages are in log n depth · Contents. Information Processing Letters. Volume 26, Issue 5 · PREVIOUS ARTICLE. Data refinement by miracles.

Input-driven languages are in log n depth. Profile image of Patrick Dymond Patrick Dymond. 1988, Information Processing Letters. See full PDF downloadDownload ...

May 26, 2017 · "Input-Driven Languages are in log n Depth." help us. How can I correct errors in dblp? contact dblp. Patrick W. Dymond (1988). top; bottom.

In this paper we shall present a log n space algorithm for the recognition of input driven languages. Our algorithm uses a black and white pebbling strategy [CS ...

Jan 11, 1988 · A context-free language 22' is input-driven if the stack motion of a pda for J? (i.e., wether it pushes of pops) can be determined from the ...

... Input-driven languages are recognized in log n space. In: Fundamentals of ... Dymond, P.W.: Input-driven languages are in log n depth. Inform. Process ...

Input-driven languages are precisely visi- bly pushdown languages (the stack operations are driven by the input).

Input driven languages are recognized in log n space. Article. Jan 1985. B ... Input-Driven Languages are in log n Depth. Article. Jan 1988; INFORM PROCESS ...

Their essential feature is that the use of the pushdown store is purely input-driven: The input alphabet is partitioned into call, return and internal letters.