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

DOI10.1016/0304-3975(91)90382-CMaRDI QIDQ808718zbMATH OpenWikidataFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Bounded Algol-Like Languages
• Extended regular expressions of star degree at most two
• The Unsolvability of the Recognition of Linear Context-Free Languages
• Two Families of Languages Related to ALGOL

Cited in

(4)

• scientific article; zbMATH DE number 1134629 (Why is no real title available?)
• Extended regular expressions of star degree at most two
• The infinite 2-star height hierarchy of extended regular languages of star degree at most two
• Extended regular expressions of arbitrary star degrees

Describes a project that uses

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)