Applications of the theory of automata in enumeration
type: Item
instance of: scholarly article
title: Applications of the theory of automata in enumeration
zbMATH Open document ID: 0676.05007
DOI: 10.1016/0012-365X(87)90196-8
author: Howard Straubing
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: After an introductory section, the paper contains a discussion of enumeration of reduced words in a finite group action (the discussion does not have any dismembering, there are no emphasized sentences, e.g. theorems). Finally, a new proof is given for \textit{P. A. MacMahon}'s Master Theorem [Combinatory analysis, Vols. I, II (1915/1916, new edition 1960; Zbl 0101.251)] [cf. also \textit{P. Cartier} and \textit{D. Foaţa}, Lect. Notes Math. 85, 54-68 (1969; Zbl 0186.30101)]. This proof uses flows and circuits of directed graphs, as well as semiautomata over commutative rings.
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4106845
zbMATH Keywords: automata and their generalizations
zbMATH Keywords: enumeration
zbMATH Keywords: finite group action
reviewed by: A. Ádám
MaRDI profile type: Publication
cites work: Q4079524
cites work: Combinatorial problems of commutation and rearrangements
cites work: Formal languages and enumeration
cites work: Q3669422
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Some Combinatorial Properties of Free Semigroups
cites work: On the definition of a family of automata
cites work: Rational functions associated to presentations of finite groups
cites work: Enumeration of words by their number of mistakes
description: scientific article; zbMATH DE number 4106845