Advertisement

Test sets for homomorphism equivalence on context free languages

  • J. Albert
  • K. CulikII
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

Abstract

We show that for every context free language L over some alphabet Σ there effectively exists a test set F, that is a finite subset of L such that, for any pair (g,h) of homomorphisms on Σ*, g(x)=h(x) for each × in F implies g(x)=h(x) for all × in L.

This result is then extended from homomorphisms to deterministic generalized sequential machine mappings defined by machines with uniformly bounded number of states.

Keywords

Finite Subset Nest Loop Context Free Grammar Derivation Tree Context Free Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, J. and Culik, K. II (1979), Test sets for homomorphisms equivalence on context free languages, Inf. and Control, to appear, also Res. Rep. CS-79-39, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
  2. Blattner, M. and Head, T. (1979), The decidability of equivalence for deterministic finite transducers, J. Computer Syst. Sci. 19, 45–49.Google Scholar
  3. Culik, K. II (1977), On the decidability of the sequence equivalence problem for DOL-systems, Theoretical Computer Sci. 3, 75–84.Google Scholar
  4. Culik, K. II (1979), Some decidability results about regular and push down translations, Information Processing Letters 8, 5–8.Google Scholar
  5. Culik, K. II (1980), Homomorphisms: Decidability, Equality and Test Sets, Proceedings of the International Symposium on Formal Languages Theory, Santa Barbara, California, Dec. 1979, to appear, also Res. Rep. CS-80-02, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
  6. Culik, K. II and Fris, I. (1977), The decidability of the equivalence problem for DOL systems, Inform. Control 35, 20–39.Google Scholar
  7. Culik, K. II and Richier, J.L. (1979), Homomorphism equivalence on ETOL languages, Int. J. Computer Math. Section A, 7, 43–51.Google Scholar
  8. Culik, K. II and Salomaa, A. (1978), On the decidability of homomorphism equivalence for languages, J. Computer Syst. Sci. 17, 163–175.Google Scholar
  9. Culik, K. II and Salomaa, A. (1979), Test sets and checking words for homomorphism equivalence, J. Computer Syst. Sci., to appear, also Res. Rep. CS-79-04, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
  10. Harrison, M.A. (1978), "Introduction to Formal Language Theory", Addison-Wesley, Reading, Massachusetts.Google Scholar
  11. Hopcroft, J.E. and Ullman, J.D. (1969), "Formal Languages and Their Relation to Automata", Addison-Wesley, Reading, Massachusetts.Google Scholar
  12. Salomaa, A. (1973), "Formal Languages", Academic Press, New York.Google Scholar
  13. Salomaa, A. (1978), Equality sets for homomorphisms on free monoids, Acta Cybernetica, vol. 4, 127–139.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • J. Albert
    • 1
  • K. CulikII
    • 2
  1. 1.Institut für Angewandte Informatik und Formale BeschreibungsverfahrenUniversität KarlsruheKarlsruheWest Germany
  2. 2.Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations