Skip to main content
SpringerLink
Log in

Equivalence problems for finite-automaton mappings into free and commutative semigroups

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. N. Red'ko, “Definitory algebras and algebras of languages,” Kibernetika, No. 4 (1973).

  2. V. N. Red'ko and L. P. Lisovik, “The identity problem for quasiregular algebras over a commutative semigroup and commutative semigroup languages,” Kibernetika, No. 5 (1975).

  3. A. W. Anisimov, “Languages over free groups”, in: Mathematical Foundations of Computer Science, 1975 (Lect. Notes Computer Sci., Vol. 32), Springer, Berlin-New York (1975), p. 167.

    Google Scholar 

  4. L. P. Lisovik, “Generalized finite generators and the identity problem for the definitory algebra of regular events,” Kibernetika, No. 1 (1975).

  5. L. P. Lisovik, “The identity problem for the algebra of regular events over semigroups,” Kibernetika, No. 2 (1977).

  6. V. A. Tuzov, “Decision problems for graph schemata with permutation operators. I, II”, Kibernetika, Nos. 4–5 (1971).

  7. V. A. Tuzov, “Equivalence of logic schemata with permutation operators,” Kibernetika, No. 6 (1970).

  8. P. M. Cohn, “Algebra and language theory,” Bull. London Math. Soc.,7 (1975).

  9. V. M. Glushkov, “Abstract automata theory”, Usp. Mat. Nauk,16, No. 5 (1961).

  10. A. W. Anisimov and F. D. Seifert, “Zur algebraischen Charakteristik der durch kontext-freie Sprachen definierten Gruppen,” Elektron. Informations-Verarb. Kybernetik,11 (1975).

  11. T. V. Griffiths, “The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines”, J. Assoc. Comput. Mach.,15, 409 (1968).

    Google Scholar 

  12. S. Ginsburg, Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).

    Google Scholar 

  13. M. R. Bird, “The equivalence problem for deterministic two-tape automata”, J. Comput. Syst. Sci.,7, No. 2 (1973).

  14. M. A. Taitslin, “Elementary theories of commutative semigroups”, Algebra Logika,5, No. 4 (1966).

  15. Yu. I. Yanov, “Logical schemata of algorithms”, in: Problems of Cybernetics [in Russian], No. 1, Fizmatgiz, Moscow (1958).

    Google Scholar 

  16. S. A. Greibach, “A remark on code sets and context-free languages,” IEEE Trans. Comput.,C-24, No. 7 (1975).

  17. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers”, in: Selected Problems of Algebra and Logic [in Russian], Nauka, Novosibirsk (1973).

    Google Scholar 

  18. A. A. Letichevskii, “Equivalence of automata with respect to semigroups”, in: Theoretical Cybernetics [in Russian], No. 6, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1970).

    Google Scholar 

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 1–7, May–June, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V., Lisovik, L.P. Equivalence problems for finite-automaton mappings into free and commutative semigroups. Cybern Syst Anal 14, 321–327 (1978). https://doi.org/10.1007/BF01074660

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01074660

Keywords

Search

Navigation