Complexity Results on Balanced Context-Free Languages

DOI10.1007/978-3-540-71389-0_25zbMath1195.68060OpenAlexW1572058359MaRDI QIDQ5758052

Yasuhiko Minamide, Akihiko Tozawa

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)

Related Items (5)

On the Balancedness of Tree-to-Word Transducers ⋮ Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable ⋮ Balancedness of MSO transductions in polynomial time ⋮ Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains ⋮ On the Balancedness of Tree-to-Word Transducers

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