Some complexity results for polynomial rational expressions.
type: Item
instance of: scholarly article
title: Some complexity results for polynomial rational expressions.
zbMATH Open document ID: 1042.68063
DOI: 10.1016/S0304-3975(01)00342-5
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1915593
zbMATH Keywords: Straubing-Thérien hierarchy
author: Pierre-Cyrille Héam
MaRDI profile type: Publication
cites work: Q3774976
cites work: Polynomial operations and hierarchies of concatenation
cites work: Q4098669
cites work: The dot-depth hierarchy of star-free languages is infinite
cites work: Complexity measures for regular expressions
cites work: Q4079524
cites work: Q4941905
cites work: Q5184421
cites work: Polynomial closure of group languages and open sets of the Hall topology
cites work: Polynomial closure and unambiguous product
cites work: Sur le produit de concatenation non ambigu
cites work: Q4077455
cites work: Complexity of some problems from the theory of automata
cites work: Finite semigroup varieties of the form V*D
cites work: Classification of finite monoids: the language approach
cites work: Inverse monoids of dot-depth two
cites work: Some results on the dot-depth hierarchy
description: scientific article; zbMATH DE number 1915593