Extended automata-like regular expressions of star degree at most (2,1)
type: Item
instance of: scholarly article
title: Extended automata-like regular expressions of star degree at most (2,1)
zbMATH Open document ID: 0732.68070
DOI: 10.1016/0304-3975(91)90382-C
author: Heekeun Yoo
author: Kosaburo Hashiguchi
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4211522
zbMATH Keywords: extended regular languages
zbMATH Keywords: linearly nested context-free languages
zbMATH Keywords: closure of the family of finite languages
zbMATH Keywords: ultralinear languages
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Q3859267
cites work: Q4430300
cites work: Q5576254
cites work: Two Families of Languages Related to ALGOL
cites work: Bounded Algol-Like Languages
cites work: The Unsolvability of the Recognition of Linear Context-Free Languages
cites work: Q4198075
cites work: Extended regular expressions of star degree at most two
cites work: Q5592246
Wikidata QID: Q127814207
description: scientific article; zbMATH DE number 4211522