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

DOI10.1016/0304-3975(91)90382-CzbMATH Open0732.68070WikidataQ127814207 ScholiaQ127814207MaRDI QIDQ808718FDOQ808718

Authors: Heekeun Yoo, Kosaburo Hashiguchi 

Publication date: 1991

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

Recommendations

• Extended regular expressions of star degree at most two
• Extended regular expressions of arbitrary star degrees
• The infinite 2-star height hierarchy of extended regular languages of star degree at most two
• Alternating finite automata and star-free languages
• Pattern expressions and pattern automata

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded Algol-Like Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two Families of Languages Related to ALGOL
• The Unsolvability of the Recognition of Linear Context-Free Languages
• Extended regular expressions of star degree at most two

Cited In (4)

• Title not available (Why is that?)
• Extended regular expressions of arbitrary star degrees
• The infinite 2-star height hierarchy of extended regular languages of star degree at most two
• Extended regular expressions of star degree at most two

Uses Software

• ALGOL 60

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808718)