On free monoids partially ordered by embedding

Cited In (59)

Title not available (Why is that?)
Relativized adjacency
A Trichotomy for Regular Trail Queries
Out Subword-Free Languages and Its Subclasses
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
Robust identification in the limit from incomplete positive data
Reachability problems on reliable and lossy queue automata
The theory of well-quasi-ordering: a frequently discovered concept
Decidability of involution hypercodes
An application of the matrix representation of transductions
Contexts on trajectories
A formalisation of the Myhill-Nerode theorem based on regular expressions
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
The syntactic monoid of hairpin-free languages
On shuffle products, acyclic automata and piecewise-testable languages
Shuffle on trajectories: Syntactic constraints
State complexity of code operators
Inflations of geometric grid classes of permutations
On total regulators generated by derivation relations
Cyclic Permutations of Letters of Words in Languages over an Alphabet
Unboundedness Problems for Languages of Vector Addition Systems.
Decision problems for convex languages
Effective constructions in well-partially-ordered free monoids
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
On approximately identifying concept classes in the limit
Rational subsets and submonoids of wreath products.
On quasi orders of words and the confluence property
On well quasi orders of free monoids
Title not available (Why is that?)
Minimal Elements for the Prime Numbers
An Algebraic Characterization of Strictly Piecewise Languages
On regularity of context-free languages
On codes defined by bio-operations
Left transformation languages
Construction of fuzzy automata from fuzzy regular expressions
General decidability results for asynchronous shared-memory programs: higher-order and beyond
The size of Higman-Haines sets
On posets of \(m\)-ary words
Nondeterministic complexity in subclasses of convex languages
Hypercodes, Right Convex Languages and their Syntactic Monoids
Quotient complexity of closed languages
Minimal forbidden subwords
Kernel methods for learning languages
The syntactic monoid of a hypercode
Title not available (Why is that?)
Infix Congruences on a Free Monoid
Maximal chains of subwords and up-down sequences of permutations
Descriptional complexity of regular languages
An Approach to Computing Downward Closures
E-convex infix codes
Codes, orderings, and partial words
Further closure properties of input-driven pushdown automata
A note on off-line machines with 'Brownian' input heads
Relations on free monoids, their independent sets, and codes¹
Formal grammars and the regeneration capability of biological systems
Finiteness conditions for finitely generated monoids
On the state complexity of closures and interiors of regular languages with subwords and superwords
Shuffled languages -- representation and recognition
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group 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)