On free monoids partially ordered by embedding

From MaRDI portal
Revision as of 04:08, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5629862

DOI10.1016/S0021-9800(69)80111-0zbMath0224.20065MaRDI QIDQ5629862

L. H. Haines

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)




Related Items (57)

Reachability problems on reliable and lossy queue automataOn total regulators generated by derivation relationsMinimal forbidden subwordsAn Approach to Computing Downward ClosuresRelations on free monoids, their independent sets, and codes1STATE COMPLEXITY OF CODE OPERATORSGeneral Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and BeyondThe syntactic monoid of hairpin-free languagesOn posets of \(m\)-ary wordsShuffle on trajectories: Syntactic constraintsQuotient complexity of closed languagesOn codes defined by bio-operationsShuffled languages -- representation and recognitionDecidability of involution hypercodesRelativized adjacencyOn approximately identifying concept classes in the limitOn the state complexity of closures and interiors of regular languages with subwords and superwordsHypercodes, Right Convex Languages and their Syntactic MonoidsUnnamed ItemA Trichotomy for Regular Trail QueriesLeft transformation languagesThe Ideal Approach to Computing Closed Subsets in Well-Quasi-orderingsOn shuffle products, acyclic automata and piecewise-testable languagesUnboundedness Problems for Languages of Vector Addition Systems.The size of Higman-Haines setsAn Algebraic Characterization of Strictly Piecewise LanguagesKernel methods for learning languagesCyclic Permutations of Letters of Words in Languages over an AlphabetConstruction of fuzzy automata from fuzzy regular expressionsFurther closure properties of input-driven pushdown automataOut Subword-Free Languages and Its SubclassesDecision problems for convex languagesCodes, orderings, and partial wordsContexts on trajectoriesFormal grammars and the regeneration capability of biological systemsEffective constructions in well-partially-ordered free monoidsGeneral decidability results for asynchronous shared-memory programs: higher-order and beyondUnnamed ItemMinimal Elements for the Prime NumbersUnnamed ItemOn regularity of context-free languagesE-convex infix codesOn well quasi orders of free monoidsOn quasi orders of words and the confluence propertyThe theory of well-quasi-ordering: a frequently discovered conceptNondeterministic complexity in subclasses of convex languagesDescriptional complexity of regular languagesFiniteness conditions for finitely generated monoidsThe syntactic monoid of a hypercodeInfix Congruences on a Free MonoidMaximal chains of subwords and up-down sequences of permutationsInflations of geometric grid classes of permutationsState complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languagesAn application of the matrix representation of transductionsA note on off-line machines with 'Brownian' input headsRational 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