Generalized Parikh mappings and homomorphisms
From MaRDI portal
Publication:3907104
DOI10.1016/S0019-9958(80)90493-3zbMath0457.68079MaRDI QIDQ3907104
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Avoiding or Limiting Regularities in Words, The binomial equivalence classes of finite words, Separating the Words of a Language by Counting Factors, On Rough Approximations of Languages under Infinite Index Indiscernibility Relations, Unnamed Item, A note on the Lie complexity and beyond, Regularity of k-Abelian Equivalence Classes of Fixed Cardinality, \(M\)-equivalence of Parikh matrix over a ternary alphabet, On \(k\)-abelian avoidability, On a generalization of abelian equivalence and complexity of infinite words, On some generalizations of abelian power avoidability, Relations on words, On some variants of Post's correspondence problem, More decidable instances of Post's correspondence problem: beyond counting, On the \(k\)-abelian complexity of the Cantor sequence, Subword histories and Parikh matrices, Generalized mapping for multiset rewriting systems, Abelian periods of factors of Sturmian words, A compactness property of the \(k\)-abelian monoids, A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences, Topological invariants for words of linear factor complexity, k-Abelian Equivalence and Rationality, On $k$-abelian equivalence and generalized Lagrange spectra
