Boolean kernels of context-free languages
type: Item
instance of: scholarly article
title: Boolean kernels of context-free languages
DOI: 10.1007/978-3-030-79121-6_13
author: Martin Kutrib
author: Luca Prigioniero
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7495112
MaRDI profile type: Publication
full work available at URL: 978-3-030-79121-6 13
OpenAlex ID: W3176181374
cites work: Regular Closure of Deterministic Languages
cites work: Self-Verifying Pushdown and Queue Automata
cites work: Q4198075
cites work: Q4199562
cites work: An efficient recognizer for the Boolean closure of context-free languages
cites work: Q3102144
cites work: On strongly context-free languages
cites work: Kernels of Sub-classes of Context-Free Languages
cites work: Finite turns and the regular closure of linear context-free languages
cites work: The Boolean closure of linear context-free languages
cites work: Boolean grammars
cites work: Nondeterminism and Boolean operations in pda's
cites work: Q3214431
cites work: Degree-languages: A new concept of acceptance
description: scientific article; zbMATH DE number 7495112