The complexity of regular DNLC graph languages
Under an Elsevier user license
open archive
Cited by (0)
- ∗
Present affiliation: Philips Research Laboratories, Eindhoven, The Netherlands.
Copyright © 1990 Published by Elsevier Inc.
Present affiliation: Philips Research Laboratories, Eindhoven, The Netherlands.