Generalized Parikh mappings and homomorphisms

DOI10.1016/S0019-9958(80)90493-3zbMath0457.68079MaRDI QIDQ3907104

Juhani Karhumäki

Publication date: 1980

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

context-free languagesregular languageslambda-free homomorphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (23)

Subword histories and Parikh matrices ⋮ On \(k\)-abelian avoidability ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Topological invariants for words of linear factor complexity ⋮ Abelian periods of factors of Sturmian words ⋮ On the \(k\)-abelian complexity of the Cantor sequence ⋮ A compactness property of the \(k\)-abelian monoids ⋮ 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 ⋮ Avoiding or Limiting Regularities in Words ⋮ Unnamed Item ⋮ On $k$-abelian equivalence and generalized Lagrange spectra ⋮ On some generalizations of abelian power avoidability ⋮ Relations on words ⋮ Separating the Words of a Language by Counting Factors ⋮ On Rough Approximations of Languages under Infinite Index Indiscernibility Relations ⋮ More decidable instances of Post's correspondence problem: beyond counting ⋮ A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences ⋮ The binomial equivalence classes of finite words ⋮ k-Abelian Equivalence and Rationality ⋮ On some variants of Post's correspondence problem ⋮ Generalized mapping for multiset rewriting systems

This page was built for publication: Generalized Parikh mappings and homomorphisms