Initial Index: A New Complexity Function for Languages

  title={Initial Index: A New Complexity Function for Languages},
  author={Joaquim Gabarr{\'o}},
A new complexity measure for languages is defined, called the initial index. This measure is of combinatorial nature ; it is a function defined by counting the minimal number of states of automata recognizing approximations of a language. The family of polynomial initial languages is defined, and it is proved that it is an intersection-closed A.F.L. The relations between this family and on-line multicounter Turing-machines, Petri-net languages and context-free languages are investigated. The… CONTINUE READING


Publications citing this paper.
Showing 1-2 of 2 extracted citations

Structural Complexity I

Texts in Theoretical Computer Science An EATCS Series • 1995
View 8 Excerpts


Publications referenced by this paper.
Showing 1-10 of 16 references

" Intersection of CFL ' s and related structures " in Actes de l ' ~ cole de printemps de th ~ orie de langages

Bucher. W K. Culik, H. Maurer, D. Wotschke.

Intersection of CFL's and related structures

R. Book
Actes de l'~cole de printemps de th~orie de langages. Editeur Blab. M. publication of LITP • 1982

Computation Sequence Sets

J. Comput. Syst. Sci. • 1976

Similar Papers

Loading similar papers…