scientific article; zbMATH DE number 3767067
From MaRDI portal
Publication:3948608
codescoloring of graphscontext-free languagesdecidabilityDOL equivalence problemDOL-systemselementary morphismsequality setsfamilies of graphsfinite power propertygrammatical familieslanguage familiesmorphic representationsmorphismsrecursively enumerable languageregular languagesrestriction of the star heightsentential forms of context-free languagesThue's problem
Cited in
(91)- On the size of the alphabet and the subword complexity of square-free DOL languages
- A complete inference system for a class of regular behaviours
- Code properties and homomorphisms of DOL systems
- A homomorphic characterization of recursively enumerable languages
- Homomorphisms of 3-chromatic graphs
- A characterization of power-free morphisms
- On three-element codes
- Feedback automata and their languages
- On infinite words obtained by selective substitution grammars
- Test sets for morphisms with bounded delay
- Adherences of DOL languages
- Repetition-free words
- Truncations of infinite matrices and algebraic series associated with some CF grammars
- A property of three-element codes
- On morphic generation of regular languages
- Periodic D0L languages
- On purely morphic characterizations of context-free languages
- Bounded D0L languages
- On a public-key cryptosystem based on iterated morphisms and substitutions
- Representations of language families by homomorphic equality operations and generalized equality sets
- A defect property of codes with unbounded delays
- A necessary condition for the rationality of the zeta function of a regular language
- The meet operation in the lattice of codes
- Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages
- A homomorphic characterization of regular languages
- Permutations are not context-free: An application of the interchange lemma
- On infinite words obtained by iterating morphisms
- A note on morphic characterization of languages
- Fibonacci morphisms and Sturmian words
- Bounded delay L codes
- Morphisms and almost-periodicity
- Sticker systems
- Monomial algebras
- On repetition-free binary words of minimal density
- On the regularity of languages generated by context-free evolutionary grammars
- A characterization of overlap-free morphisms
- Morphic congruences and D0L languages
- Semiretracts of a free monoid
- Exponential upper and lower bounds for the order of a regular language
- On the subword equivalence problem for morphic words
- Growth, unavoidable words, and M. Sapir's conjecture for semigroup varieties.
- Refining the hierarchy of blind multicounter languages and twist-closed trios.
- Homomorphic characterizations of recursively enumerable languages with very small language classes
- The commutation of finite sets: A challenging problem
- Morphismes unispectraux. (Unispectral morphisms)
- On cube-free \(\omega\)-words generated by binary morphisms
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- Topics in the theory of DNA computing.
- Thin and slender languages
- Globally deterministic CD-systems of stateless R-automata with window size 1
- On syntactic nuclei of rational languages
- Square-free words with one possible mismatch
- SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES
- On characterisation of language families in terms of inverse morphisms
- TYPES OF GROWTH AND IDENTITIES OF SEMIGROUPS
- Density of grammar forms. part I
- Density of grammar forms part II
- Time varying finite automata
- Context-free languages consisting of non-primitive words
- Decidability of the problem of semantic equivalence of words in the class of syntax-directed translations
- Inferring regular languages by merging nonterminals
- Probabilistic Parallel Communicating Grammar Systems
- On CD-systems of stateless deterministic R-automata with window size one
- Some algorithms for equivalent transformation of nondeterministic finite automata
- It is decidable whether or not a permutation-free morphism is an l code
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
- Languages and P0L schemes
- Regularity of sets of initial strings of periodic D0L-systems
- Relatively free semigroups of intermediate growth
- Marked PCP is decidable
- On the subword complexity of m-free DOL languages
- Fuzzy \(L\) languages
- On the subword complexity of iteratively generated infinite words.
- On combinatorial properties of the Arshon sequence
- Operations and language generating devices suggested by the genome evolution
- Language-theoretic problems arising from Richelieu cryptosystems
- Efficient constructions of test sets for regular and context-free languages
- Some remarks on non-algebraic adherences
- L codes and number systems
- Unique representation in number systems and L codes
- Infinite arrays and controlled deterministic table 0L array systems
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- On the subword complexity of DOL languages with a constant distribution
- On k-repetition freeness of length uniform morphisms over a binary alphabet
- Complexity of normal form grammars
- On regularity of languages generated by copying systems
- Many aspects of formal languages
- A powerful abelian square-free substitution over 4 letters
- Growth problems for avoidable words
- Polynomial growth in semigroup varieties.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948608)
