The Boolean Closure of Growing Context-Sensitive Languages

DOI10.1007/11779148_23zbMath1227.68059OpenAlexW1596201808MaRDI QIDQ3617062

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Lower bound technique for length-reducing automata ⋮ On the Computational Capacity of Parallel Communicating Finite Automata

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