Expressive capacity of subregular expressions
From MaRDI portal
Publication:5223616
DOI10.1051/ita/2018014zbMath1475.68162OpenAlexW2914181013WikidataQ128538461 ScholiaQ128538461MaRDI QIDQ5223616
Matthias Wendlandt, Martin Kutrib
Publication date: 18 July 2019
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2018014
characterizationsregular expressionsclosure propertiesstar-free languagesunion-free languagesconcatenation-free languagesexpressive capacitysubregular hierarchy
Related Items
Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages ⋮ Expressive capacity of subregular expressions ⋮ Union-complexities of Kleene plus operation
Cites Work
- Nondeterministic state complexity of star-free languages
- Alternating finite automata and star-free languages
- Concatenation-free languages
- Dot-depth of star-free events
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
- Expressive Capacity of Concatenation Freeness
- The Frobenius Problem and Its Generalizations
- Expressive capacity of subregular expressions
- On finite monoids having only trivial subgroups
- Isometries on positive operators of unit norm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item