Fast nondeterministic recognition of context-free languages using two queues

Journal article

Peer reviewed

Information processing letters, Vol.67(2), pp.91-93

1998

Abstract

Theory of computation

Formal languages

Algorithms

We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.

10 Record Views

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.61 Artificial Intelligence & Machine Learning; 4.61.1988 Formal Languages
Web Of Science research areas: Computer Science, Information Systems
ESI research areas: Computer Science

This output has contributed to the advancement of the following goals:

Source: InCites

Title: Fast nondeterministic recognition of context-free languages using two queues
Creators: Burton Rosenberg - University of Miami, Ungar Computer Center of Mathematics and Computer Science, P.O. Box 249085, Coral Gables, FL 33124, USA
Publication Details: Information processing letters, Vol.67(2), pp.91-93
Publisher: Elsevier B.V
Academic Unit: College of A&S; A&S - Computer Science
Language: English
Resource Type: Journal article
Record Identifier: 991031576958302976