The Boolean Closure of Growing Context-Sensitive Languages

DOI10.1007/11779148_23zbMATH Open1227.68059OpenAlexW1596201808MaRDI QIDQ3617062FDOQ3617062

Authors: Tomasz Jurdziński 

Publication date: 26 March 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

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

Recommendations

• The Boolean closure of growing context-sensitive languages
• Developments in Language Theory
• The Boolean closure of linear context-free languages
• On growing context-sensitive languages
• Growing context-sensitive languages and Church-Rosser languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• On the Computational Capacity of Parallel Communicating Finite Automata
• The Boolean closure of linear context-free languages
• Lower bound technique for length-reducing automata
• Developments in Language Theory
• Title not available (Why is that?)
• The Boolean closure of growing context-sensitive languages

This page was built for publication: The Boolean Closure of Growing Context-Sensitive Languages

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