On free monoids partially ordered by embedding

Cited in

(57)

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

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)