The inherent ambiguity partial algorithm problem for context free languages
From MaRDI portal
Recommendations
- Algorithmic decidability of restricted ambiguity in context-free grammars
- scientific article; zbMATH DE number 1834688
- Finite generation of ambiguity in context-free languages
- A note on ambiguity in context-free grammars
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases
- The inclusion problem of context-free languages: some tractable cases
- scientific article; zbMATH DE number 7453188
- A Polynomial Algorithm for the Inference of Context Free Languages
- scientific article; zbMATH DE number 3259059
- An undecidable problem for context-free grammars
Cited in
(15)- scientific article; zbMATH DE number 3932414 (Why is no real title available?)
- Finite generation of ambiguity in context-free languages
- scientific article; zbMATH DE number 2086661 (Why is no real title available?)
- A note on ambiguity in context-free grammars
- Equivalent conversions of ambiguous context-free grammars
- scientific article; zbMATH DE number 65744 (Why is no real title available?)
- scientific article; zbMATH DE number 7453188 (Why is no real title available?)
- scientific article; zbMATH DE number 3438410 (Why is no real title available?)
- Not all multi-valued partial CFL functions are refined by single-valued functions (extended abstract)
- scientific article; zbMATH DE number 3911733 (Why is no real title available?)
- A context-free language decision problem
- scientific article; zbMATH DE number 3907801 (Why is no real title available?)
- Analytic models and ambiguity of context-free languages
- scientific article; zbMATH DE number 1836426 (Why is no real title available?)
- scientific article; zbMATH DE number 3980517 (Why is no real title available?)
This page was built for publication: The inherent ambiguity partial algorithm problem for context free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402501)