scientific article
From MaRDI portal
Publication:4001349
zbMath0746.20050MaRDI QIDQ4001349
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
codessyntactic monoidsbalanced languagesalgebraic theory of languagescommuting languagesdisjunctive context-free languagesprefix and suffix codes
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorial codes (94B25) Research exposition (monographs, survey articles) pertaining to group theory (20-02)
Related Items (only showing first 100 items - show all)
Morphisms preserving densities ⋮ Palindrome words and reverse closed languages ⋮ Relations on free monoids, their independent sets, and codes1 ⋮ Context-free languages consisting of non-primitive words ⋮ On primitive words with non-primitive product ⋮ Finite Completion of comma-free codes Part 1 ⋮ Finite Completion of comma-free codes Part 2 ⋮ Dense property of initial literal shuffles ⋮ A completion algorithm for codes with bounded synchronization delay ⋮ Insertion and deletion of words: Determinism and reversibility ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the complexity of decision problems for some classes of machines and applications ⋮ The second step in characterizing a three-word code ⋮ Systems of equations over a finite set of words and automata theory ⋮ Rich words in the block reversal of a word ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ Uniformly bounded duplication codes ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars ⋮ On the Density of Context-Free and Counter Languages ⋮ Restricted Burnside problem for semigroups and its application to language theory ⋮ Semaphore Codes and Ideals ⋮ Unnamed Item ⋮ WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID ⋮ P-disjunctive ω-languages ⋮ Languages and P0L schemes ⋮ Equations on partial words ⋮ Variable-length codes for error correction ⋮ The disjunctivity of primitive languages ⋮ Some property-preserving homomorphisms ⋮ Local languages ⋮ Disjunctive languages and compatible orders ⋮ Unnamed Item ⋮ A note on the free submonoids of the monoid of prefix codes ⋮ \(k\)-p-infix codes and semaphore codes ⋮ Post-plus languages ⋮ Squares of regular languages ⋮ Count of primitive words ⋮ k-involution codes and related sets ⋮ Finite maximal solid codes ⋮ Operations and language generating devices suggested by the genome evolution ⋮ Overlapping words, codes, disjunctivity and density of languages ⋮ Brick codes: families, properties, relations ⋮ Watson-Crick Conjugate and Commutative Words ⋮ Characterizations of \(k\)-comma codes and \(k\)-comma intercodes ⋮ Networks with Evolutionary Processors and Ideals and Codes as Filters ⋮ Randomized generation of error control codes with automata and transducers ⋮ 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 ⋮ n-Prefix–suffix languages∗ ⋮ 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) ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters ⋮ Regular component decomposition of regular languages. ⋮ Primitive morphisms ⋮ Some properties of involution codes ⋮ Transducers and the decidability of independence in free monoids ⋮ Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes ⋮ Monoids with disjunctive identity and their codes ⋮ Deciding determinism of caterpillar expressions ⋮ On the robustness of primitive words ⋮ Congruences, infix and cohesive prefix codes ⋮ Slender 0L languages ⋮ FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ Automata accepting primitive words ⋮ The syntactic monoid of hairpin-free languages ⋮ Disjunctive splittability of languages ⋮ Relatively f-disjunctive languages ⋮ Fuzzy language on free monoid ⋮ Codes defined by multiple sets of trajectories ⋮ Alternative proof of the Lyndon-Schützenberger theorem ⋮ On the complexity of decision problems for counter machines with applications to coding theory ⋮ A periodicity result of partial words with one hole ⋮ \(\alpha\)-words and factors of characteristic sequences ⋮ Free submonoids in the monoid of languages ⋮ On the existence of prime decompositions ⋮ The single loop representations of regular languages ⋮ A note on prefix primitive words ⋮ Counting (Watson-Crick) palindromes in Watson-Crick conjugates ⋮ 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\) ⋮ Disjunctive languages related to \(p\)-primitive words ⋮ Coding properties of DNA languages. ⋮ Relativized codes ⋮ Some results in \(r\)-disjunctive languages and related topics ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Grammatical complexity of one-dimensional maps with multiple monotone intervals ⋮ Some kinds of primitive and non-primitive words ⋮ A note of involutively bordered words ⋮ Bond-free DNA language classes ⋮ Solid codes and the uniform density of fd-domains. ⋮ Some properties of involution binary relations ⋮ Languages whose \(n\)-element subsets are codes ⋮ Relatively regular languages and thin codes ⋮ Outfix and infix codes and related classes of languages
This page was built for publication:
