arrow
Return

Subregular Expressions with Two Operations

delete2026-01-01
delete0
PRE
AI
M
Martin Kutrib *
P
Priscilla Raucci
M
Matthias Wendlandt
DOI:10.1007/978-3-032-01475-7_16delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
Subregular expressions are closely related to regular expressions, but instead of relying solely on the classical operations of union, concatenation, and Kleene star, they explore subsets of operations under which regular languages remain closed. Previous work has examined various combinations of these operations, including complement and intersection, alongside the standard trio. In this work, we investigate several unexplored combinations of operations, focusing specifically on three language families, namely, subregular expressions with complement and Kleene star, subregular expressions with concatenation and complement, and subregular expressions with intersection and Kleene star. We examine basic properties of these families of languages and analyze how these families relate to each other. Further, we distinguish between the unary and general alphabet cases, and explore the possibility of a hierarchical structure based on the number of operations used.
Keywords:
LANGUAGES

Journal

D
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2025
IF:
0
Papers:
19
Citations:
0

Organization

J
justus liebig university giessen
Scholars:
1.5W
Papers: 1.2W
Citations: 95
Cited Papers

Cited Papers

On Decompositions of Regular Events
err1969-01-01
err0
PREAI
errBrzozowski,J. A.; Cohen,Rina
errShare
errSave
Roots of Star Events
err1967-07-01
err0
PREAI
errBrzozowski,J. A.
errShare
errSave
The Theory of Definite Automata
err1963-06-01
err0
PREAI
errPerles,M.; Rabin,M. O.; Shamir,E.
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
Concatenation-free languages
err2017-05-01
err0
PREAI
errKutrib,Martin; Wendlandt,Matthias
errShare
errSave
researcher View more