Recognizing rooted context-free flowgraph languages in polynomial time

DOI10.1007/BFB0017411MaRDI QIDQ4037326zbMATH OpenFDO

Authors Ulrike Lichtblau

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017411

zbMATH Keywords

context-free flowgraph grammarsdecompilationEarley's recognizing algorithmgraph grammar

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3909759
• A Polynomial Algorithm for the Inference of Context Free Languages
• scientific article; zbMATH DE number 3978426
• Parallel time O(log n) recognition of unambiguous context-free languages
• scientific article; zbMATH DE number 4051027
• scientific article; zbMATH DE number 4106286
• scientific article; zbMATH DE number 4060749
• A graph-based regularity test for deterministic context-free languages
• scientific article; zbMATH DE number 4060748

Cited in

(4)

• scientific article; zbMATH DE number 4162279 (Why is no real title available?)
• An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
• scientific article; zbMATH DE number 3909759 (Why is no real title available?)
• Drawing graphs with attribute graph grammars

This page was built for publication: Recognizing rooted context-free flowgraph languages in polynomial time

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