Fast nondeterministic recognition of context-free languages using two queues

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

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

Original languageEnglish (US)
Pages (from-to)91-93
Number of pages3
JournalInformation Processing Letters
Volume67
Issue number2
StatePublished - Jul 30 1998

Keywords

  • Algorithms
  • Formal languages
  • Theory of computation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Fast nondeterministic recognition of context-free languages using two queues'. Together they form a unique fingerprint.

  • Cite this