Star-freeness, first-order definability and aperiodicity of structured context-free languages

DOI10.1007/978-3-030-64276-1_9OpenAlexW3106870970MaRDI QIDQ2037942

Stefano Crespi Reghizzi, Matteo Pradella, Dino Mandrioli

Publication date: 8 July 2021

Full work available at URL: http://hdl.handle.net/11311/1156727

zbMATH Keywords

first-order logicmonadic second-order logicstar-free languagesvisibly-pushdown languagesinput-driven languagesoperator precedence languagesaperiodic languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Model-checking structured context-free languages ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Unnamed Item