Publication:4001349
From MaRDI portal
zbMath0746.20050MaRDI QIDQ4001349
Publication date: 18 September 1992
codes; syntactic monoids; balanced languages; algebraic theory of languages; commuting languages; disjunctive context-free languages; prefix and suffix codes
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
68-02: Research exposition (monographs, survey articles) pertaining to computer science
94B25: Combinatorial codes
20-02: Research exposition (monographs, survey articles) pertaining to group theory
Related Items
Local languages, The problem of freedom on certain subsemigroups of the submonoid of left singular languages, Two classes of languages related to the prefix codes, Optimal Prefix Codes And Huffman Codes, Palindrome words and reverse closed languages, Squares of regular languages, n-Prefix–suffix languages∗, Morphisms preserving densities, Finite Completion of comma-free codes Part 1, Finite Completion of comma-free codes Part 2, Brick codes: families, properties, relations, k-involution codes and related sets, Overlapping words, codes, disjunctivity and density of languages, Watson-Crick Conjugate and Commutative Words, Languages and P0L schemes, \(k\)-p-infix codes and semaphore codes, Post-plus languages, Count of primitive words, Finite maximal solid codes, Operations and language generating devices suggested by the genome evolution, Product of Finite Maximal P-Codes. This paper was supported in part by HK UGC grants 9040596, 9040511 and City U Strategic Grants 7001189, 7001060, and by the Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural Science Foundation (project No. 001174), A periodicity result of partial words with one hole, A note on prefix primitive words, On group codes, Completion of recognizable bifix codes, Decompositions of recognizable strong maximal codes, Equations over finite sets of words and equivalence problems in automata theory, Codes, orderings, and partial words, Three-element codes with one \(d\)-primitive word, Deciding determinism of caterpillar expressions, Codes defined by multiple sets of trajectories, Alternative proof of the Lyndon-Schützenberger theorem, On the existence of prime decompositions, Marcus contextual languages consisting of primitive words, Synchronization, Periodicity properties on partial words, On pseudoknot-bordered words and their properties, Regular autodense languages, Topology on words, On the Shyr-Yu theorem, Monoids with disjunctive identity and their codes, Automata accepting primitive words, Disjunctive splittability of languages, Relatively f-disjunctive languages, Languages whose \(n\)-element subsets are codes, Outfix and infix codes and related classes of languages, On the structure of some group codes, Unbordered factors of the characteristic sequences of irrational numbers, \(d\)-minimal languages, Scattered deletion and commutativity, Monogenic \(e\)-closed languages and dipolar words, Right \(k\)-dense languages, Transducers and the decidability of independence in free monoids, Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes, On the robustness of primitive words, Congruences, infix and cohesive prefix codes, Slender 0L languages, Fuzzy language on free monoid, \(\alpha\)-words and factors of characteristic sequences, Free submonoids in the monoid of languages, The single loop representations of regular languages, Structure of 3-infix-outfix maximal codes., Insertion and deletion closure of languages, A representation theorem of the suffixes of characteristic sequences, Combinatorial properties of codes with degree \(n\), Coding properties of DNA languages., Shuffle and scattered deletion closure of languages, A characterization of local regular languages, Error-detecting properties of languages, Language equations, maximality and error-detection, Is independence an exception?, The disjunctivities of \(\omega\)-languages., Disjunctive decomposition of languages, Anti-commutative languages and n-codes, Regular component decomposition of regular languages., Grammatical complexity of one-dimensional maps with multiple monotone intervals, Some operations preserving primitivity of words, Bond-free DNA language classes, Solid codes and the uniform density of fd-domains., Relatively regular languages and thin codes, Primitive partial words, Dependences related to strict binary relations, The syntactic monoid of hairpin-free languages, Classifications of bifix codes, INVOLUTIVELY BORDERED WORDS, PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS, Annihilators of bifix codes, δ-codes and δ-languages, Generalized periodicity and primitivity for words, Dense property of initial literal shuffles, Uniformly bounded duplication codes, WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID, Equations on partial words, Semaphore Codes and Ideals, Disjunctive languages and compatible orders, A note on the free submonoids of the monoid of prefix codes, Relations on free monoids, their independent sets, and codes1, Context-free languages consisting of non-primitive words
