Abstract
While the closure of a language family \(\mathscr {L}\) under certain language operations is the least family of languages which contains all members of \(\mathscr {L}\) and is closed under all of the operations, a kernel of \(\mathscr {L}\) is a maximal family of languages which is a sub-family of \(\mathscr {L}\) and is closed under all of the operations. Here we investigate properties of the Boolean kernels of the family of context-free languages. Additionally, languages that are mandatory for each Boolean kernel and languages that are optional for Boolean kernels are studied. That is, we consider the intersection of all Boolean kernels as well as their union. The expressive capacities of these families are addressed leading to a hierarchical structure. Further closure properties are considered. Furthermore, we study descriptional complexity aspects of these families, where languages are represented by context-free grammars with proofs attached. It turns out that the size trade-offs between all families in question and deterministic context-free languages are non-recursive. That is, one can choose an arbitrarily large recursive function f, but the gain in economy of description eventually exceeds f when changing from the latter system to the former.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput. 29, 81–102 (1999)
Fernau, H., Kutrib, M., Wendlandt, M.: Self-verifying pushdown automata. Fundam. Inform. 180, 1–28 (2021)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)
Hartmanis, J.: On the succinctness of different representations of languages. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 282–288. Springer, Heidelberg (1979). https://doi.org/10.1007/3-540-09510-1_22
Heilbrunner, S., Schmitz, L.: An efficient recognizer for the Boolean closure of context-free languages. Theor. Comput. Sci. 80, 53–75 (1991)
Holzer, M., Kutrib, M.: Descriptional complexity - an introductory survey. In: Martín-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1–58. Imperial College Press (2010)
Ilie, L., Păun, G., Rozenberg, G., Salomaa, A.: On strongly context-free languages. Discret. Appl. Math. 103, 158–165 (2000)
Kutrib, M.: Kernels of sub-classes of context-free languages. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 136–147. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-38919-2_12
Kutrib, M., Malcher, A.: Finite turns and the regular closure of linear context-free languages. Discret. Appl. Math. 155, 2152–2164 (2007)
Kutrib, M., Malcher, A., Wotschke, D.: The Boolean closure of linear context-free languages. Acta Inform. 45, 177–191 (2008)
Okhotin, A.: Boolean grammars. Inform. Comput. 194, 19–48 (2004)
Wotschke, D.: Nondeterminism and Boolean operations in PDA’s. J. Comput. Syst. Sci. 16, 456–461 (1978)
Wotschke, D.: The Boolean closures of the deterministic and nondeterministic context-free languages. In: Brauer, W. (ed.) GI 1973. LNCS, vol. 1, pp. 113–121. Springer, Heidelberg (1973). https://doi.org/10.1007/3-540-06473-7_11
Wotschke, D.: Degree-languages: a new concept of acceptance. J. Comput. Syst. Sci. 14, 187–209 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Kutrib, M., Prigioniero, L. (2021). Boolean Kernels of Context-Free Languages. In: Maneth, S. (eds) Implementation and Application of Automata. CIAA 2021. Lecture Notes in Computer Science(), vol 12803. Springer, Cham. https://doi.org/10.1007/978-3-030-79121-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-79121-6_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79120-9
Online ISBN: 978-3-030-79121-6
eBook Packages: Computer ScienceComputer Science (R0)