scientific article; zbMATH DE number 3252233
From MaRDI portal
Publication:5538951
Cited in
(9)- Maximal chains of subwords and up-down sequences of permutations
- Ordinal recursive bounds for Higman's theorem
- Effective constructions in well-partially-ordered free monoids
- A syntactic approach to the MacNeille completion of ^, the free monoid over an ordered alphabet
- The theory of well-quasi-ordering: a frequently discovered concept
- Injective envelopes of transition systems and Ferrers languages
- Hypercodes, Right Convex Languages and their Syntactic Monoids
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Directed regular and context-free languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538951)
