On free monoids partially ordered by embedding

Cited in

(61)

Maximal chains of subwords and up-down sequences of permutations
An application of the matrix representation of transductions
On total regulators generated by derivation relations
Shuffle on trajectories: Syntactic constraints
Left transformation languages
Formal grammars and the regeneration capability of biological systems
Effective constructions in well-partially-ordered free monoids
On well quasi orders of free monoids
On quasi orders of words and the confluence property
On shuffle products, acyclic automata and piecewise-testable languages
Construction of fuzzy automata from fuzzy regular expressions
E-convex infix codes
On posets of \(m\)-ary words
General decidability results for asynchronous shared-memory programs: higher-order and beyond
Descriptional complexity of regular languages
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Nondeterministic complexity in subclasses of convex languages
Inflations of geometric grid classes of permutations
A formalisation of the Myhill-Nerode theorem based on regular expressions
The size of Higman-Haines sets
The theory of well-quasi-ordering: a frequently discovered concept
Finiteness conditions for finitely generated monoids
The syntactic monoid of a hypercode
The syntactic monoid of hairpin-free languages
Minimal elements for the prime numbers
State complexity of code operators
An Algebraic Characterization of Strictly Piecewise Languages
The ideal approach to computing closed subsets in well-quasi-orderings
An approach to computing downward closures
Infix Congruences on a Free Monoid
Cyclic Permutations of Letters of Words in Languages over an Alphabet
Shuffled languages -- representation and recognition
Hypercodes, Right Convex Languages and their Syntactic Monoids
Relations on free monoids, their independent sets, and codes¹
Decidability of involution hypercodes
Contexts on trajectories
Testing hereditary properties of sequences
Unboundedness problems for languages of vector addition systems
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
scientific article; zbMATH DE number 7204383 (Why is no real title available?)
scientific article; zbMATH DE number 7056230 (Why is no real title available?)
Decision problems for convex languages
Out subword-free languages and its subclasses
Further closure properties of input-driven pushdown automata
Relativized adjacency
On approximately identifying concept classes in the limit
A Trichotomy for Regular Trail Queries
Robust identification in the limit from incomplete positive data
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
k-universality of regular languages
Directed regular and context-free languages
Priority downward closures
Verifying unboundedness via amalgamation
Codes, orderings, and partial words
On regularity of context-free languages
A note on off-line machines with 'Brownian' input heads
Reachability problems on reliable and lossy queue automata
Minimal forbidden subwords
On codes defined by bio-operations
On the state complexity of closures and interiors of regular languages with subwords and superwords
Kernel methods for learning languages

This page was built for publication: On free monoids partially ordered by embedding

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