Pages that link to "Item:Q5629862"
From MaRDI portal
The following pages link to On free monoids partially ordered by embedding (Q5629862):
Displaying 50 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Decidability of involution hypercodes (Q401315) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Codes, orderings, and partial words (Q706621) (← links)
- On regularity of context-free languages (Q759489) (← links)
- A note on off-line machines with 'Brownian' input heads (Q801900) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Minimal forbidden subwords (Q834943) (← links)
- On codes defined by bio-operations (Q884441) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- Maximal chains of subwords and up-down sequences of permutations (Q1053690) (← links)
- An application of the matrix representation of transductions (Q1057659) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- Left transformation languages (Q1157915) (← links)
- Formal grammars and the regeneration capability of biological systems (Q1226395) (← links)
- Effective constructions in well-partially-ordered free monoids (Q1249047) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- On quasi orders of words and the confluence property (Q1276254) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- On shuffle products, acyclic automata and piecewise-testable languages (Q1730033) (← links)
- Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
- E-convex infix codes (Q1820251) (← links)
- On posets of \(m\)-ary words (Q1917485) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Inflations of geometric grid classes of permutations (Q2339726) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- The theory of well-quasi-ordering: a frequently discovered concept (Q2554710) (← links)
- Finiteness conditions for finitely generated monoids (Q2560330) (← links)
- The syntactic monoid of a hypercode (Q2560906) (← links)
- The syntactic monoid of hairpin-free languages (Q2641875) (← links)
- Minimal Elements for the Prime Numbers (Q2815500) (← links)
- STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
- An Algebraic Characterization of Strictly Piecewise Languages (Q3010406) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Infix Congruences on a Free Monoid (Q3812464) (← links)
- Cyclic Permutations of Letters of Words in Languages over an Alphabet (Q3833643) (← links)
- Hypercodes, Right Convex Languages and their Syntactic Monoids (Q3933182) (← links)
- Relations on free monoids, their independent sets, and codes<sup>1</sup> (Q3979693) (← links)
- Contexts on trajectories (Q4935387) (← links)
- (Q5002650) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
