Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-12-14
Computer Science
Formal Languages and Automata Theory
Scientific paper
Cross-bifix-free sets are sets of words such that no prefix of any word is a
suffix of any other word. In this paper, we introduce a general constructive
method for the sets of cross-bifix-free binary words of fixed length. It
enables us to determine a cross-bifix-free words subset which has the property
to be non-expandable.
Bilotta Stefano
Pergola Elisa
Pinzani Renzo
No associations
LandOfFree
A new approach to cross-bifix-free sets 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 A new approach to cross-bifix-free sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new approach to cross-bifix-free sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-226063