Applications of the theory of automata in enumeration

DOI10.1016/0012-365X(87)90196-8zbMATH Open0676.05007MaRDI QIDQ1122575FDOQ1122575

Howard Straubing

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Non-commutative extensions of the MacMahon Master Theorem
• Extension of MacMahon's master theorem to pre-semi-rings
• Applications in enumerative combinatorics of infinite weighted automata and graphs
• Reductive enumeration under mutually orthogonal group actions
• On the asymptotic enumeration of accessible automata

zbMATH Keywords

enumerationfinite group actionautomata and their generalizations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the definition of a family of automata
• Combinatorial problems of commutation and rearrangements
• Some Combinatorial Properties of Free Semigroups
• String overlaps, pattern matching, and nontransitive games
• Formal languages and enumeration
• Enumeration of words by their number of mistakes
• Rational functions associated to presentations of finite groups

Cited In (6)

• Applications of the finite state automata for counting restricted permutations and variations
• The method of forced enumeration for nondeterministic automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• The combinatorics of a class of representation functions
• Title not available (Why is that?)

This page was built for publication: Applications of the theory of automata in enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122575)