Counting and Generating Permutations Using Timed Languages

DOI10.1007/978-3-642-54423-1_44MaRDI QIDQ5405068zbMATH OpenOpenAlexFDO

Authors Nicolas Basset

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_44

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Recommendations

• Generating Functions of Timed Languages
• Combinatorial generation via permutation languages
• Combinatorial generation via permutation languages. I: Fundamentals
• ON A HIERARCHY OF PERMUTATION LANGUAGES
• Generating Multiset Permutations in Constant Time
• Finding and Counting Permutations via CSPs
• Finding and counting permutations via CSPs
• Combinatorial generation via permutation languages. II. Lattice congruences
• Generating Countable Sets of Permutations
• Combinatorial generation via permutation languages. III: Rectangulations

Cited in

(10)

• Signatures des permutations et des mots extraits. (Signatures of permutations and extracted words)
• A context-free grammar for peaks and double descents of permutations
• A maximal entropy stochastic process for a timed automaton
• Counting and generating permutations in regular classes
• Generating permutations with given ups and downs
• On the frequencies of patterns of rises and falls
• Combinatorial generation via permutation languages
• Joint distributions of permutation statistics and the parabolic cylinder functions
• Entropy of regular timed languages
• Generating Functions of Timed Languages

This page was built for publication: Counting and Generating Permutations Using Timed Languages

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