Skip to main content
Log in

On α 2ν 2-products of automata

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Two equivalent sufficient conditions are given for the completeness of classes of finite automata with respect to the isomorphic simulation under the α 2ν 2-product. It is conjectured that these conditions are also necessary with respect to the isomorphic or homomorphic simulation too.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dömösi, P.: On α23-products of automata. 7th International Conference on Automata and Formal Languages. Salgótarján (1993). Publ. Math. 48(suppl.), 233–242 (1996)

  2. Dömösi, P., Ésik, Z.: Homomorphic simulation and Letichevsky’s criterion. In: 2nd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures. London (2000). J. Automata Lang. Comb. 6(4), 427–436 (2001)

  3. Dömösi P., Imreh B.: On ν i -products of automata. Acta Cybern. 6, 149–162 (1989)

    Google Scholar 

  4. Dömösi P., Nehaniv C.L.: On complete systems of automata. Theor. Comput. Sci. 245, 27–54 (2000)

    Article  MATH  Google Scholar 

  5. Dömösi P., Nehaniv C.L.: Algebraic Theory of Automata Networks. An Introduction. SIAM, Philadelphia (2005)

    Book  MATH  Google Scholar 

  6. Ésik Z.: Homomorphically complete classes of automata with respect to the α2-product. Acta Sci. Math. 48, 135–141 (1985)

    MATH  Google Scholar 

  7. Gécseg, F.: Composition of automata. In: Automata, Languages and Programming: 2nd Colloquium, Saarbrücken, Lecture Notes in Computer Science, vol. 14, pp. 351–363. Springer, Berlin (1974)

  8. Gécseg F.: On products of abstract automata. Acta Sci. Math. 38, 21–43 (1976)

    MATH  Google Scholar 

  9. Gécseg F.: Products of Automata. EATCS Monographs on Theoretical Computer Science vol. 7. Springer, Berlin (1986)

    Google Scholar 

  10. Gécseg F., Jürgensen H.: On α0 − ν1-products of automata. Theor. Comput. Sci. 80, 35–51 (1991)

    Article  MATH  Google Scholar 

  11. Gécseg, F., Peák, I.: Algebraic Theory of Automata. Disquisitiones Mathematicae Hungaricae, vol. 2. Akadémiai Kiadó, Budapest (1972)

  12. Gluškov, V.M.: The abstract theory of automata. Uspekhi Mat. Nauk, 16(5), 3–62 (1961); Correction: ibid., 17(2), 270 (1962)

  13. Gluškov V.M.: On complete system operations in computers (in Russian). Kibernetika (Kiev) 2, 1–5 (1968)

    Google Scholar 

  14. Letichevsky, A.A.: Completeness conditions for finite automata (in Russian). Ž. Vyčisl. Mat. i Mat. Fiz. 1, 702–710 (1961); translated as Comut. Math. and Math. Phys. 1, 702–710 (1961)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to György Maróti.

Additional information

To the honor of Professor Zoltán Ésik on his 60th birthday.

P. Dömösi has been supported by the project NYF-VEKTOR of Nyíregyháza College under grant No. TIOP-1.3.1-10/1-2010-0013 and the Czech-Hungarian Bilateral Research Foundation under grant No. CZ-01/2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dömösi, P., Maróti, G. On α 2ν 2-products of automata. Acta Informatica 48, 397–408 (2011). https://doi.org/10.1007/s00236-011-0143-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-011-0143-x

Keywords

Navigation