A simplified lower bound for context-free-language recognition

DOI10.1016/S0019-9958(86)80048-1MaRDI QIDQ3742752zbMATH OpenFDO

Authors Joel I. Seiferas

Publication date 1986

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(86)80048-1

zbMATH Keywords

descriptional complexitydeterministic multitape Turing machinelinear context-free languageon-line recognitionword length

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• The recognition of deterministic CFLs in small time and space
• scientific article; zbMATH DE number 3978426
• scientific article; zbMATH DE number 3958761
• Publication:4207603
• scientific article; zbMATH DE number 3913680

Cited in

(10)

• Independence results about context-free languages and lower bounds
• A lower bound for the nondeterministic space complexity of context-free recognition
• Certifying DFA bounds for recognition and separation
• The recognition of deterministic CFLs in small time and space
• scientific article; zbMATH DE number 3917734 (Why is no real title available?)
• Eine untere Schranke für den Platzbedarf bei der Analyse beschränkter kontextfreier Sprachen
• scientific article; zbMATH DE number 4128421 (Why is no real title available?)
• If the current clique algorithms are optimal, so is Valiant's parser
• TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
• Online context-free recognition in OMv time

This page was built for publication: A simplified lower bound for context-free-language recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742752)