Easy multiplications. I: The realm of Kleene's theorem
type: Item
instance of: scholarly article
title: Easy multiplications. I: The realm of Kleene's theorem
zbMATH Open document ID: 0642.20043
DOI: 10.1016/0890-5401(87)90020-4
author: Jacques Sakarovitch
published in: Information and Computation
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 4046026
zbMATH Keywords: rational monoids
zbMATH Keywords: multiplication of low complexity
zbMATH Keywords: free monoid
zbMATH Keywords: Green's relations
zbMATH Keywords: Kleene's theorem
zbMATH Keywords: Rees' quotient
zbMATH Keywords: free product
zbMATH Keywords: Extensions
Wikidata QID: Q56481486
MaRDI profile type: Publication
full work available at URL: 0890-5401(87)90020-4
OpenAlex ID: W2047831757
cites work: Generalizations of regular events
cites work: Q3859267
cites work: Q5552797
cites work: Q5564342
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: Q3853827
cites work: Q5513066
cites work: Equidivisible semigroups
cites work: Q3689369
DBLP publication ID: journals/iandc/Sakarovitch87
Recommended article: Q4515274
Recommended article: Multiplication is the easiest nontrivial arithmetic function
Recommended article: Easy multiplications. II: Extensions of rational semigroups
Recommended article: Q4130368
Recommended article: Q4130369
Recommended article: The complexity of iterated multiplication
Recommended article: Patterns and complexity of multiplicative functions
Recommended article: The structure of multiplicatives
Recommended article: An extremely simple proof of the K-K-M-S theorem
Recommended article: A Note on Easy Proofs of Stirling's Theorem
description: scientific article; zbMATH DE number 4046026