Test sets for homomorphism equivalence on context free languages

DOI10.1016/S0019-9958(80)90659-2zbMath0453.68048OpenAlexW2091723354MaRDI QIDQ3901015

Karel II Culik, Juergen Albert

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(80)90659-2

zbMATH Keywords

Ehrenfeucht's conjecturedeterministic generalized sequential machine mappingsgeneralized pumping lemma for context-free languageshomomorphic equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On some transducer equivalence problems for families of languages ⋮ Polynomial size test sets for commutative languages

This page was built for publication: Test sets for homomorphism equivalence on context free languages