Skip to main content
SpringerLink
Log in

On some problems concerning Pawlak's machines

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 32))

  • 1869 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pawlak, Z., Maszyny programowane. Algorytmy 10 (1969), 7–22.

    Google Scholar 

  2. Bartol, W., Programy dynamiczne obliczeń. Państwowe wydawnictwo naukowe, Warszawa 1974.

    Google Scholar 

  3. Novotný, M., O jednom problému z teorie zobrazení. Spisy vyd. Přír. Fak. Univ. Masaryk Brno, No 344 (1953), 53–64.

    Google Scholar 

  4. Novotný, M., Über Abbildungen von Mengen. Pac. J. Math. 13 (1963), 1347–1359.

    Google Scholar 

  5. Kopeček, O., Homomorphisms of machines. To appear.

    Google Scholar 

  6. Kopeček, O., The category of connected partial unary algebras. To appear.

    Google Scholar 

  7. Novotný, M., Characterization of the category of connected partial unary algebras. To appear.

    Google Scholar 

  8. Rabin, M.O., and Scott, D., Finite automata and their decision problems. IBM Systems J. 3 (1959), 115–125.

    Google Scholar 

  9. Ginsburg, S., The Mathematical Theory of Context-Free Languages, Mc Graw-Hill, New York-London, 1966.

    Google Scholar 

  10. Novotný, M., Sets constructed by acceptors. Information and Control 26 (1974), 116–133.

    Article  Google Scholar 

  11. Kwasowiec, W., Generable sets. Information and Control 17 (1970), 257–264.

    Article  Google Scholar 

  12. Mezník, I., G-machines and generable sets. Information and Control 20 (1972), 499–509.

    Article  Google Scholar 

  13. Grodzki, Z., The k-machines. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 7 (1970), 399–403.

    Google Scholar 

  14. Mezník, I., On structural properties of generable languages. These Proceedings p. 320–325.

    Google Scholar 

  15. Karásek, J., Sets of sequences constructed by nondeterministic k-machines and deterministic k-machines. To appear.

    Google Scholar 

  16. Karásek, J., Induced algebras. Arch. Math. (Brno) 6 (1970), 71–87.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Czechoslovak Academy of Sciences, Branch Brno, Janáčkovo nám. 2a, 662 95, Brno

    Miroslav Novotný

Authors
  1. Miroslav Novotný
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Novotný, M. (1975). On some problems concerning Pawlak's machines. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_184

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_184

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation