Extended automata-like regular expressions of star degree at most (2,1)

DOI10.1016/0304-3975(91)90382-CzbMath0732.68070WikidataQ127814207 ScholiaQ127814207MaRDI QIDQ808718

Heekeun Yoo, Kosaburo Hashiguchi

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

closure of the family of finite languagesextended regular languageslinearly nested context-free languagesultralinear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Extended regular expressions of arbitrary star degrees

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended regular expressions of star degree at most two
• Bounded Algol-Like Languages
• The Unsolvability of the Recognition of Linear Context-Free Languages
• Two Families of Languages Related to ALGOL

This page was built for publication: Extended automata-like regular expressions of star degree at most (2,1)