Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-10-15
Computer Science
Formal Languages and Automata Theory
22 pages, 8 figures in .eepic format
Scientific paper
The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We study the syntactic complexity of the class of regular ideal languages and their complements, the closed languages. We prove that $n^{n-1}$ is a tight upper bound on the complexity of right ideals and prefix-closed languages, and that there exist left ideals and suffix-closed languages of syntactic complexity $n^{n-1}+n-1$, and two-sided ideals and factor-closed languages of syntactic complexity $n^{n-2}+(n-2)2^{n-2}+1$.
Brzozowski Janusz
Ye Yuli
No associations
LandOfFree
Syntactic Complexity of Ideal and Closed 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 Syntactic Complexity of Ideal and Closed Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Syntactic Complexity of Ideal and Closed Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-181306