An improved lower bound on the formula complexity of context-free recognition

Mehlhorn, Kurt

Local TagsRelease HistoryDetailsSummary

An improved lower bound on the formula complexity of context-free recognition

Mehlhorn, K.(1976). An improved lower bound on the formula complexity of context-free recognition (Local-ID: C1256428004B93B8-CD622EEA82E2D4C9C125721B00327D32-mehlhorn76v). Saarbrücken: Fachbereich Informatik, Universität des Saarlandes.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AFCC-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3F9E-C

Genre: Report

Files

show Files

Locators

show

Creators

show

hide

Creators:
Mehlhorn, Kurt¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1976

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Fachbereich Informatik, Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344756
Other: Local-ID: C1256428004B93B8-CD622EEA82E2D4C9C125721B00327D32-mehlhorn76v

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Report

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -