Skip to main content
SpringerLink
Log in

Some combinatorial problems concerning finite languages

  • Chapter 1 VLSI And Formal Languages
  • Conference paper
  • First Online:
Trends, Techniques, and Problems in Theoretical Computer Science (IMYCS 1986)

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

Included in the following conference series:

  • 148 Accesses

Abstract

Some combinatorial functions are introduced for finite languages. Various conjectures and problems are raised.

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. C. Berge, Graphs and Hypergraphs, North-Holland, 1973.

    Google Scholar 

  2. W. Bucher, K. Culik II, H. Maurer and D. Wotschke, Concise description of finite languages, Theoretical Computer Sci. 14 (1981) 227–246.

    Google Scholar 

  3. P. Erdös, A. Hajnal and J.W. Moon, A problem in graph theory, Amer. Math. Monthly 71(1964) 1107–1110.

    Google Scholar 

  4. T. Gallai, Über extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 2 (1959) 133–138.

    Google Scholar 

  5. L. Kászonyi and Zs. Tuza, Saturated graphs with minimal number of edges, J. Graph Theory 10 (1986) 203–210.

    Google Scholar 

  6. J. Lehel, Covers in hypergraphs, Combinatorica 2 (1982) 305–309.

    Google Scholar 

  7. J. Lehel and Zs. Tuza, Triangle-free partial graphs and edge covering theorems, Discrete Math. 39 (1982) 59–65.

    Google Scholar 

  8. W. Mader, 1-Faktoren in Graphen, Math. Ann. 201 (1973) 269–282.

    Google Scholar 

  9. L.T. Ollman, K2,2-saturated graphs with a minimal number of edges, in: Proc. 3rd South-East Conference on Combinatorics, Graph Theory and Computing, pp. 367–392.

    Google Scholar 

  10. A. Salomaa, Formal Languages, Academic Press, 1973.

    Google Scholar 

  11. M. Truszczyński and Zs. Tuza; Asymptotic results on saturated graphs, submitted.

    Google Scholar 

  12. Zs. Tuza, On the context-free production complexity of finite languages, Discrete Applied Math., to appear.

    Google Scholar 

  13. Zs. Tuza, A generalization of saturated graphs for finite languages, MTA SZTAKI Studies 185/1986, pp. 287–293.

    Google Scholar 

  14. Zs. Tuza, Intersection properties and extremal problems for set systems, in: Irregularities of Partitions, Proc. Colloq. Math. Soc. János Bolyai, Fertöd (Hungary) 1986, to appear.

    Google Scholar 

  15. Zs. Tuza, A conjecture on triangles of graphs, in preparation.

    Google Scholar 

  16. Zs. Tuza, Perfect triangle families, in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Institute, Hungarian Academy of Sciences, Kende u. 13–17, H-1111, Budapest, Hungary

    Zsolt Tuza

Authors
  1. Zsolt Tuza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alica Kelemenová Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tuza, Z. (1987). Some combinatorial problems concerning finite languages. In: Kelemenová, A., Kelemen, J. (eds) Trends, Techniques, and Problems in Theoretical Computer Science. IMYCS 1986. Lecture Notes in Computer Science, vol 281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540185356_30

Download citation

  • DOI: https://doi.org/10.1007/3540185356_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18535-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation