Counting and Generating Permutations Using Timed Languages

DOI10.1007/978-3-642-54423-1_44zbMath1351.05005OpenAlexW355029109MaRDI QIDQ5405068

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)

Related Items (6)

A context-free grammar for peaks and double descents of permutations ⋮ On the frequencies of patterns of rises and falls ⋮ Counting and generating permutations in regular classes ⋮ Joint distributions of permutation statistics and the parabolic cylinder functions ⋮ Entropy of regular timed languages ⋮ A maximal entropy stochastic process for a timed automaton

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