Test sets for morphisms with bounded delay
- 31 October 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 12 (2) , 93-101
- https://doi.org/10.1016/0166-218x(85)90063-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On binary equality sets and a solution to the test set conjecture in the binary caseJournal of Algebra, 1983
- On the Ehrenfeucht conjecture for DOL languagesRAIRO. Informatique théorique, 1983
- Systems of equations over a free monoid and Ehrenfeucht's conjectureDiscrete Mathematics, 1983
- The (generalized) post correspondence problem with lists consisting of two words is decidableTheoretical Computer Science, 1982
- Test sets for context free languages and algebraic systems of equations over a free monoidInformation and Control, 1982
- Test sets and checking words for homomorphism equivalenceJournal of Computer and System Sciences, 1980
- On the equality sets for homomorphisms on free monoids with two generatorsRAIRO. Informatique théorique, 1980
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978