Some combinatorial problems concerning finite languages

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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

Original languageEnglish
Title of host publicationTrends, Techniques, and Problems in Theoretical Computer Science - 4th International Meeting of Young Computer Scientists, Selected Contributions
PublisherSpringer Verlag
Pages51-58
Number of pages8
ISBN (Print)9783540185352
DOIs
Publication statusPublished - Jan 1 1987
Event4th International Meeting of Young Computer Scientists, 1986 - Smolenice, Serbia
Duration: Oct 13 1986Oct 17 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume281 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Meeting of Young Computer Scientists, 1986
CountrySerbia
CitySmolenice
Period10/13/8610/17/86

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tuza, Z. (1987). Some combinatorial problems concerning finite languages. In Trends, Techniques, and Problems in Theoretical Computer Science - 4th International Meeting of Young Computer Scientists, Selected Contributions (pp. 51-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 281 LNCS). Springer Verlag. https://doi.org/10.1007/3540185356_30