scientific article; zbMATH DE number 3767068
From MaRDI portal
Publication:3948609
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
(36)- Free subalgebras of Lie algebras close to nilpotent
- On the structure of some group codes
- On characterizations of recursively enumerable languages
- Unavoidable binary patterns
- On simplest possible solutions for Post Correspondence Problems
- The Thue problem and logical specifications of derivation in formal systems
- Algebras of linear growth and the dynamical Mordell-Lang conjecture
- Existence of words over three-letter alphabet not containing squares with replacement errors
- Detecting leftmost maximal periodicities
- Algorithmic ways of deciding whether an infinite language is a code
- Existence of words over a binary alphabet free from squares with mismatches
- A characterization of free pairs of upper triangular free monoid morphisms
- Growth of positive words and lower bounds of the growth rate for Thompson's groups F(p)
- scientific article; zbMATH DE number 3808975 (Why is no real title available?)
- A linear-time algorithm to decide whether a binary word contains an overlap
- Caractérisation results about L codes
- Distance automata having large finite distance or finite ambiguity
- A remark on morphic sturmian words
- On the power of periodic iteration of morphisms
- If a DOL language is k-power free then it is circular
- Degrees of infinite words, polynomials and atoms
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
- Exponential Diophantine equations in rings of positive characteristic
- Abelian squares are avoidable on 4 letters
- PCP-prime words and primality types
- A periodicity property of iterated morphisms
- On public-key cryptosystem based on Church-Rosser string-rewriting systems
- A rewriting of Fife's theorem about overlap-free words
- Central extensions and groups with quotients periodic infinite
- Comparing descriptional and computational complexity of infinite words
- Commuting upper triangular binary morphisms
- Finite maximal codes and factorizations of cyclic groups
- The monadic theory of toric words
- Finite maximal codes and triangle conjecture
- On some variants of Post's correspondence problem
- Symmetric graphs and interpretations
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 Q3948609)
