Formal languages and enumeration

DOI10.1016/0097-3165(78)90062-6MaRDI QIDQ1259601zbMATH OpenOpenAlexFDO

Authors Jay R. Goldman

Publication date 1978

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(78)90062-6

zbMATH Keywords

enumerationgenerating functionsformal languagesgeneratorsfree monoidwordring of formal power seriessystem of formal equationsformal substitution schema

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3239536 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3304066 (Why is no real title available?)
• scientific article; zbMATH DE number 3321968 (Why is no real title available?)
• scientific article; zbMATH DE number 3344587 (Why is no real title available?)
• Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
• First Passage and Recurrence Distributions
• Functional Composition Patterns and Power Series Reversion
• On Picture-Writing
• On a Theorem of R. Jungen

Cited in

(19)

• Enumeration d'arbres et formules d'inversion de séries formelles
• Random generation of words in an algebraic language in linear binary space
• Applications of the theory of automata in enumeration
• Lattice path enumeration by formal schema
• Enumeration of skew Ferrers diagrams and basic Bessel functions
• Algebraic languages and polyominoes enumeration
• A combinatorial interpretation for two transformations of series that commute with compositional inversion
• The area determined by underdiagonal lattice paths
• Operatorenkalkül über freien Monoiden I: Strukturen
• Underdiagonal lattice paths with unrestricted steps
• Context-free grammars, differential operators and formal power series
• Counting problems and algebraic formal power series in noncommuting variables
• On pairs of non-crossing generalized Dyck paths
• Attribute grammars are useful for combinatorics
• Enumeration of compositions with prescribed parts
• Perron-Frobenius theory of some algebraic equations associated with context free grammars
• On languages accepted with simultaneous complexity bounds and their ranking problem
• Two short proofs of Kemp's identity for rooted plane trees
• The complexity of computing the number of strings of given length in context-free languages

This page was built for publication: Formal languages and enumeration

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