Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A note on autodense related languages
Fan C., Huang C., Shyr H., Chen K. Acta Informatica47 (4):209-219,2010.Type:Article
Date Reviewed: Oct 13 2010

A formal language is autodense if any word can be modified by a prefix and a suffix to become a member. It is anti-autodense if adjoining a prefix and a suffix to a member always removes it from the language.

Fan et al. have studied similar properties of languages for many years. This short note, of interest almost exclusively to specialists, collects various properties of autodense and anti-autodense languages, with proofs. The proofs are mostly straightforward set-theoretic arguments. No big theorem is presented, but many propositions are stated and proved.

Reviewer:  J. Wolper Review #: CR138483 (1102-0196)
Bookmark and Share
 
Algebraic Language Theory (F.4.3 ... )
 
 
Coding And Information Theory (E.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Algebraic Language Theory": Date
Products of languages with counter
Weil P. Theoretical Computer Science 76(2-3): 251-260, 2001. Type: Article
Oct 1 1991
On characterizations of recursively enumerable languages
Latteux M., Turakainen P. Acta Informatica 28(2): 179-186, 1990. Type: Article
Dec 1 1991
Effective construction of the synthetic algebra of a recognizable series on trees
Bozapalidis S. Acta Informatica 28(4): 351-363, 1991. Type: Article
May 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy