Pattern avoiding permutations are context-sensitive

Abstract

We establish a bijection from the set of all permutations (of a given length) that avoid a pattern $q$ and a context-sensitive language.

References in corpus (2)

• Formal Languages and Infinite Groups
• On groups whose word problem is solved by a nested stack automaton

Cited by in corpus (1)

• Permutations generated by a depth 2 and infinite stack in series are algebraic