Combinatorial Characterization of Formal Languages

Details Combinatorial Characterization of Formal Languages Combinatorial Characterization of Formal Languages

2010-10-26

arxiv.org/abs/1010.5456v1

Computer Science

Formal Languages and Automata Theory

41 page 1 figure, 1 table

Scientific paper

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a "counting" function associated with a language and returning the number of words of given length in this language. For several classes of languages, a variety of problems about combinatorial complexity and its connections to other parameters of languages are studied. A brief introduction to the topic and the formulations of results are presented. No proofs are given; instead, the papers containing the proofs are cited.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Characterization of Formal Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Characterization of Formal Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Characterization of Formal Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159933