๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An NC algorithm for recognizing tree adjoining languages

โœ Scribed by Michael A. Palis; Sunil M. Shende

Publisher
Springer
Year
1992
Tongue
English
Weight
697 KB
Volume
21
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for recognizing palm polygo
An algorithm for recognizing palm polygons
โœ Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; C. E. Veni Madhavan ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Springer ๐ŸŒ English โš– 878 KB
XGLRโ€”an algorithm for ambiguity in progr
XGLRโ€”an algorithm for ambiguity in programming languages
โœ Andrew Begel; Susan L. Graham ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

Automatically generated lexers and parsers for programming languages have a long history. Although they are well suited for many languages, many widely used generators, among them Flex and Bison, fail to handle input stream ambiguities that arise in embedded languages, in legacy languages, and in pr

An NC Parallel Algorithm for Edge-Colori
An NC Parallel Algorithm for Edge-Coloring Seriesโ€“Parallel Multigraphs
โœ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

Many combinatorial problems can be efficiently solved in parallel for seriesแŽparallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for seriesแŽparallel multigraphs. This paper gives an NC parallel algorithm for the