scientific article; zbMATH DE number 1988973

Publication date: 20 October 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (only showing first 100 items - show all)

Regular component decomposition of regular languages. ⋮ On the effects of noise and speed on computations ⋮ Infinite words and biprefix codes ⋮ Identification of all trinucleotide circular codes ⋮ Many aspects of defect theorems ⋮ On factorizing codes: Structural properties and related decision problems ⋮ Representation of rational functions with prefix and suffix codings ⋮ Semiretracts of a free monoid ⋮ A fast algorithm for the unique decipherability of multivalued encodings ⋮ Codon phylogenetic distance ⋮ On the set of uniquely decodable codes with a given sequence of code word lengths ⋮ Synchronization and decomposability for a family of codes. II ⋮ Congruences, infix and cohesive prefix codes ⋮ On codes, \(\omega\)-codes and \(\omega\)-generators ⋮ A note on codes having no finite completions ⋮ Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms ⋮ On numerically decipherable codes and their homophonic partitions ⋮ Robust universal complete codes for transmission and compression ⋮ Random and uniform generation of words ⋮ A characterization of substitutive sequences using return words ⋮ Circular codes in archaeal genomes ⋮ Higher dimensional generalizations of the Thompson groups ⋮ Structure of 3-infix-outfix maximal codes. ⋮ Hajós factorizations and completion of codes. ⋮ Insertion and deletion closure of languages ⋮ Sturmian words: structure, combinatorics, and their arithmetics ⋮ A note on decidability questions on presentations of word semigroups ⋮ The code problem for traces -- improving the boundaries ⋮ Combinatorial properties of codes with degree \(n\) ⋮ Completing comma-free codes ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes ⋮ Essential molecular functions associated with the circular code evolution ⋮ On maximal synchronous codes. ⋮ The homomorphism problem for trace monoids. ⋮ Derivatives of rational expressions and related theorems. ⋮ Completion of codes with finite bi-decoding delays. ⋮ Coded equivalence of one-sided topological Markov shifts ⋮ Automata for solid codes ⋮ Relational codes of words ⋮ Prefix-free regular languages and pattern matching ⋮ Completing circular codes in regular submonoids ⋮ A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes ⋮ Codes of central Sturmian words ⋮ An enhanced property of factorizing codes ⋮ Growth of repetition-free words -- a review ⋮ Commutation with codes ⋮ Regular splicing languages and subclasses ⋮ Mergible states in large NFA ⋮ Completions in measure of languages and related combinatorial problems ⋮ Random generation of DFAs ⋮ Deciding whether a finite set of words has rank at most two ⋮ The standard factorization of Lyndon words: an average point of view ⋮ Language equations, maximality and error-detection ⋮ Linear splicing and syntactic monoid ⋮ Partial words and the critical factorization theorem ⋮ Borderedness-preserving homomorphisms ⋮ Characteristic morphisms of generalized episturmian words ⋮ Predictable semiautomata ⋮ The structure of reflexive regular splicing languages via Schützenberger constants ⋮ Finitely generated sofic systems ⋮ On the sentence valuation in a semiring ⋮ Periodicities on trees ⋮ On the bound of the synchronization delay of a local automaton ⋮ Preservation of normality by transducers ⋮ On maximal codes with bounded synchronization delay ⋮ A conjecture on continued fractions ⋮ Generating functions of circular codes ⋮ Anti-commutative languages and n-codes ⋮ On infinite Gröbner bases in free algebras ⋮ On Gröbner bases of noncommutative power series ⋮ Reductions and functors from problems to word problems ⋮ The intersection of retracts of \(A^{*}\) ⋮ \(\beta\)-expansions and symbolic dynamics ⋮ Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems) ⋮ \(d\)-minimal languages ⋮ Deterministic generalized automata ⋮ On the combinatorics of finite words ⋮ Fine and Wilf's theorem for three periods and a generalization of Sturmian words ⋮ Maximal bifix codes ⋮ Generalized factorizations of words and their algorithmic properties ⋮ On repetition-free binary words of minimal density ⋮ Finite homotopy bases of one-relator monoids ⋮ Normal forms of quasiperiodic strings ⋮ On the lattice of prefix codes. ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ Cumulative defect. ⋮ An algebra of discrete channels that involve combinations of three basic error types ⋮ On some Schützenberger conjectures ⋮ Existence of constants in regular splicing languages ⋮ A partial result about the factorization conjecture for finite variable- length codes ⋮ A non-ambiguous decomposition of regular languages and factorizing codes ⋮ Periodicity vectors for labelled trees ⋮ A weak equivalence between shifts of finite type ⋮ Monogenic \(e\)-closed languages and dipolar words ⋮ Error-detecting properties of languages ⋮ The commutation of finite sets: A challenging problem ⋮ Some combinatorial results on Bernoulli sets and codes ⋮ On maximal codes with a finite interpreting delay. ⋮ Locally complete sets and finite decomposable codes

This page was built for publication: