Extended regular expressions of arbitrary star degrees
From MaRDI portal
Publication:1193870
DOI10.1016/0304-3975(92)90075-QzbMath0769.68069OpenAlexW1964824772MaRDI QIDQ1193870
Heekeun Yoo, Kosaburo Hashiguchi
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90075-q
regular expressionsfinite languagescontext-sensitive languagesinclusion problemstar degreesstar operators
Uses Software
Cites Work
- Extended automata-like regular expressions of star degree at most (2,1)
- Extended regular expressions of star degree at most two
- A characterization of context-free languages
- Bounded Algol-Like Languages
- The Unsolvability of the Recognition of Linear Context-Free Languages
- Two Families of Languages Related to ALGOL
- Inclusion relations among families of context-free languages
- Cap expressions for context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item