Skip to main content
SpringerLink
Log in

Finite-automaton semigroup mappings

  • 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. A. V. Anisimov, “On group languages,” Kibernetika, No. 4, 18–24 (1971).

    Google Scholar 

  2. A. V. Anisimov, “On algorithmic problems for groups and context-free languages,” Kibernetika, No. 2, 4–11 (1972).

    Google Scholar 

  3. A. V. Anisimov, “Formal grammars that take into account external terminal contexts,” Kibernetika, No. 3, 81–88 (1974).

    Google Scholar 

  4. A. V. Anisimov, “Syntactic properties of recursive programs,” Kibernetika, No. 3, 51–59 (1977).

    Google Scholar 

  5. A. V. Anisimov and L. P. Lisovik, “The equivalence problem of finite-automaton mappings into a free and a commutative semigroup,” Kibernetika, No. 3, 1–8 (1978).

    Google Scholar 

  6. A. V. Aho and J. D. Ullmann, Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, N. J. (1973).

    Google Scholar 

  7. A. O. Buda, “Abstract program machines,” Preprint Vychisl. Tsentr Sib. Otd. Akad. Nauk SSSR No. 108, Novosibirsk (1978).

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

    Google Scholar 

  9. V. E. Itkin, “Logic term equivalent program schemes,” Kibernetika, No. 1, 5–27 (1972).

    Google Scholar 

  10. M. Mesarovic and Y. Takahara, General Systems Theory. Mathematical Foundations, Academic, New York (1974).

    Google Scholar 

  11. V. N. Red'ko, “Definator algebras and language algebras,” Kibernetika, No. 4, 57–63 (1973).

    Google Scholar 

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

    Google Scholar 

  13. V. A. Tuzov, “Equivalent logic schemes with commuting operators,” Kibernetika, No. 6, 33–38 (1970).

    Google Scholar 

  14. Yu. I. Yanov, “On logic schemes of algorithms,” Probl. Kibern., No. 1, 75–127 (1958).

    Google Scholar 

  15. A. V. Anisimov (Anissimow) and F. D. Seifert, “On the algebraic characteristic of groups defined by context-free languages,” Electron. Inform. Kybern.,11, 695–702 (1975).

    Google Scholar 

  16. M. Blattner and T. Head, “Single-valueda-transducers,” J. Comput. Syst. Sci.,15, No. 3, 310–327 (1977).

    Google Scholar 

  17. M. Blattner and T. Head, “The decidability of equivalence for deterministic finite transducers,” J. Comput. Syst. Sci.,19, No. 1, 45–49 (1979).

    Google Scholar 

  18. O. H. Ibarra, “The unsolvability of the equivalence problem for ε-free NGSMs with unary input (output) alphabet and applications,” SIAM J. Comput.,7, No. 4, 524–532 (1978).

    Google Scholar 

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

    Google Scholar 

  20. T. V. Griffiths, “The unsolvability of the equivalence for ε-free nondeterministic generalized machines,” J. Assoc. Comput. Mach.,15, 409–413 (1968).

    Google Scholar 

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 1–7, September–October, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Finite-automaton semigroup mappings. Cybern Syst Anal 17, 571–578 (1981). https://doi.org/10.1007/BF01068773

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation