On free monoids partially ordered by embedding
From MaRDI portal
Publication:5629862
DOI10.1016/S0021-9800(69)80111-0zbMath0224.20065MaRDI QIDQ5629862
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (57)
Reachability problems on reliable and lossy queue automata ⋮ On total regulators generated by derivation relations ⋮ Minimal forbidden subwords ⋮ An Approach to Computing Downward Closures ⋮ Relations on free monoids, their independent sets, and codes1 ⋮ STATE COMPLEXITY OF CODE OPERATORS ⋮ General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond ⋮ The syntactic monoid of hairpin-free languages ⋮ On posets of \(m\)-ary words ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Quotient complexity of closed languages ⋮ On codes defined by bio-operations ⋮ Shuffled languages -- representation and recognition ⋮ Decidability of involution hypercodes ⋮ Relativized adjacency ⋮ On approximately identifying concept classes in the limit ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Hypercodes, Right Convex Languages and their Syntactic Monoids ⋮ Unnamed Item ⋮ A Trichotomy for Regular Trail Queries ⋮ Left transformation languages ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ The size of Higman-Haines sets ⋮ An Algebraic Characterization of Strictly Piecewise Languages ⋮ Kernel methods for learning languages ⋮ Cyclic Permutations of Letters of Words in Languages over an Alphabet ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Further closure properties of input-driven pushdown automata ⋮ Out Subword-Free Languages and Its Subclasses ⋮ Decision problems for convex languages ⋮ Codes, orderings, and partial words ⋮ Contexts on trajectories ⋮ Formal grammars and the regeneration capability of biological systems ⋮ Effective constructions in well-partially-ordered free monoids ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Unnamed Item ⋮ Minimal Elements for the Prime Numbers ⋮ Unnamed Item ⋮ On regularity of context-free languages ⋮ E-convex infix codes ⋮ On well quasi orders of free monoids ⋮ On quasi orders of words and the confluence property ⋮ The theory of well-quasi-ordering: a frequently discovered concept ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Descriptional complexity of regular languages ⋮ Finiteness conditions for finitely generated monoids ⋮ The syntactic monoid of a hypercode ⋮ Infix Congruences on a Free Monoid ⋮ Maximal chains of subwords and up-down sequences of permutations ⋮ Inflations of geometric grid classes of permutations ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages ⋮ An application of the matrix representation of transductions ⋮ A note on off-line machines with 'Brownian' input heads ⋮ Rational subsets and submonoids of wreath products. ⋮ A formalisation of the Myhill-Nerode theorem based on regular expressions
This page was built for publication: On free monoids partially ordered by embedding