Some combinatorial problems concerning finite languages

  • Zsolt Tuza
Chapter 1 VLSI And Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 281)


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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Berge, Graphs and Hypergraphs, North-Holland, 1973.Google Scholar
  2. 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. 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. 4.
    T. Gallai, Über extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 2 (1959) 133–138.Google Scholar
  5. 5.
    L. Kászonyi and Zs. Tuza, Saturated graphs with minimal number of edges, J. Graph Theory 10 (1986) 203–210.Google Scholar
  6. 6.
    J. Lehel, Covers in hypergraphs, Combinatorica 2 (1982) 305–309.Google Scholar
  7. 7.
    J. Lehel and Zs. Tuza, Triangle-free partial graphs and edge covering theorems, Discrete Math. 39 (1982) 59–65.Google Scholar
  8. 8.
    W. Mader, 1-Faktoren in Graphen, Math. Ann. 201 (1973) 269–282.Google Scholar
  9. 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. 10.
    A. Salomaa, Formal Languages, Academic Press, 1973.Google Scholar
  11. 11.
    M. Truszczyński and Zs. Tuza; Asymptotic results on saturated graphs, submitted.Google Scholar
  12. 12.
    Zs. Tuza, On the context-free production complexity of finite languages, Discrete Applied Math., to appear.Google Scholar
  13. 13.
    Zs. Tuza, A generalization of saturated graphs for finite languages, MTA SZTAKI Studies 185/1986, pp. 287–293.Google Scholar
  14. 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. 15.
    Zs. Tuza, A conjecture on triangles of graphs, in preparation.Google Scholar
  16. 16.
    Zs. Tuza, Perfect triangle families, in preparation.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Zsolt Tuza
    • 1
  1. 1.Computer and Automation InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations