Fast uniform analysis of Coupled-Context-Free languages

DOI10.1007/3-540-58201-0_86MaRDI QIDQ4632444zbMATH OpenOpenAlexFDO

Authors Günter Hotz, Gisela Pitsch

Publication date 29 April 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58201-0_86

zbMATH Keywords

derivation treeinfinite loopnormal formproduction nodetime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• On parsing coupled-context-free languages
• A new approach to analyse coupled-context-free languages
• scientific article; zbMATH DE number 994049
• scientific article; zbMATH DE number 1254100
• scientific article; zbMATH DE number 777296

Cites work

• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• On certain formal properties of grammars
• Recognition and parsing of context-free languages in time n3
• Scattered context grammars
• Some inherently ambiguous context-free languages
• Tree adjunct grammars

Cited in

(7)

• On parsing coupled-context-free languages
• LR(k)-coupled-context-free grammars
• scientific article; zbMATH DE number 994049 (Why is no real title available?)
• A new approach to analyse coupled-context-free languages
• scientific article; zbMATH DE number 1254100 (Why is no real title available?)
• scientific article; zbMATH DE number 777296 (Why is no real title available?)
• Bounded fixed-point definability and tabular recognition of languages

This page was built for publication: Fast uniform analysis of Coupled-Context-Free languages

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