Complexity Results on Balanced Context-Free Languages

DOI10.1007/978-3-540-71389-0_25MaRDI QIDQ5758052zbMATH OpenOpenAlexFDO

Authors Akihiko Tozawa, Yasuhiko Minamide

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_25

Mathematics Subject Classification ID

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

Recommendations

• Verified Decision Procedures on Context-Free Grammars
• Context-Free Grammars and XML Languages
• XML Validation for Context-Free Grammars
• The word problem for visibly pushdown languages described by grammars
• scientific article; zbMATH DE number 3963215

Cited in

(13)

• Complexity results on register context-free grammars and register tree automata
• Balancedness of MSO transductions in polynomial time
• Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
• Complexity results on register context-free grammars and related formalisms
• HTML validation of context-free languages
• Verified Decision Procedures on Context-Free Grammars
• Context-Free Grammars and XML Languages
• Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
• On the balancedness of tree-to-word transducers
• XML Validation for Context-Free Grammars
• scientific article; zbMATH DE number 5201364 (Why is no real title available?)
• On the Balancedness of Tree-to-Word Transducers
• Slice closures of indexed languages and word equations with counting constraints

This page was built for publication: Complexity Results on Balanced Context-Free Languages

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