diff --git a/alib2algo/src/string/properties/BadCharacterShiftTable.cpp b/alib2algo/src/string/properties/BadCharacterShiftTable.cpp
index 7d1b613b11ef18a3ac68a7110d767a81b0468b7a..2ce43f29d3a78bbcc45d0519bbe6ef80b14c0f23 100644
--- a/alib2algo/src/string/properties/BadCharacterShiftTable.cpp
+++ b/alib2algo/src/string/properties/BadCharacterShiftTable.cpp
@@ -11,11 +11,11 @@ namespace string {
 
 namespace properties {
 
-std::map<alphabet::Symbol, size_t> BadCharacterShiftTable::bcs(const string::String& pattern) {
+std::map<DefaultSymbolType, size_t> BadCharacterShiftTable::bcs(const string::String& pattern) {
 	return dispatch(pattern.getData());
 }
 
-auto BadCharacterShiftTableLinearString = BadCharacterShiftTable::RegistratorWrapper<std::map<alphabet::Symbol, size_t>, string::LinearString < >>(BadCharacterShiftTable::bcs);
+auto BadCharacterShiftTableLinearString = BadCharacterShiftTable::RegistratorWrapper<std::map<DefaultSymbolType, size_t>, string::LinearString < >>(BadCharacterShiftTable::bcs);
 
 } /* namespace properties */
 
diff --git a/alib2algo/src/string/properties/BadCharacterShiftTable.h b/alib2algo/src/string/properties/BadCharacterShiftTable.h
index a46bf6556af5e5c5f1c8e50f79973fdf97dce2a1..55b5080e50f4068d799df705d9e30d3dfa332605 100644
--- a/alib2algo/src/string/properties/BadCharacterShiftTable.h
+++ b/alib2algo/src/string/properties/BadCharacterShiftTable.h
@@ -26,13 +26,13 @@ namespace properties {
  * Computation of BCS table for BMH from MI(E+\eps)-EVY course 2014
  * To get rid of zeros in BCS table we ignore last haystack character
  */
-class BadCharacterShiftTable : public std::SingleDispatch < BadCharacterShiftTable, std::map < alphabet::Symbol, size_t >, const string::StringBase & > {
+class BadCharacterShiftTable : public std::SingleDispatch < BadCharacterShiftTable, std::map < DefaultSymbolType, size_t >, const string::StringBase & > {
 public:
 	/**
 	 * Search for pattern in linear string.
 	 * @return set set of occurences
 	 */
-	static std::map < alphabet::Symbol, size_t > bcs ( const string::String & pattern );
+	static std::map < DefaultSymbolType, size_t > bcs ( const string::String & pattern );
 
 	template < class SymbolType >
 	static std::map < SymbolType, size_t > bcs ( const string::LinearString < SymbolType > & pattern );
diff --git a/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.cpp b/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.cpp
index 93323282aafd487dea713e465b2e156fb34f8dd2..640fb26e9609d318de14237f777886f8e8ebfdd5 100644
--- a/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.cpp
+++ b/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.cpp
@@ -11,11 +11,11 @@ namespace string {
 
 namespace properties {
 
-std::map < alphabet::Symbol, size_t > ReversedBadCharacterShiftTable::bcs ( const string::String & pattern ) {
+std::map < DefaultSymbolType, size_t > ReversedBadCharacterShiftTable::bcs ( const string::String & pattern ) {
 	return dispatch ( pattern.getData ( ) );
 }
 
-auto ReversedBadCharacterShiftTableLinearString = ReversedBadCharacterShiftTable::RegistratorWrapper < std::map < alphabet::Symbol, size_t >, string::LinearString < > > ( ReversedBadCharacterShiftTable::bcs );
+auto ReversedBadCharacterShiftTableLinearString = ReversedBadCharacterShiftTable::RegistratorWrapper < std::map < DefaultSymbolType, size_t >, string::LinearString < > > ( ReversedBadCharacterShiftTable::bcs );
 
 } /* namespace properties */
 
diff --git a/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.h b/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.h
index 04c22221992d139c518fe562127436019e7c5d87..6fa22048b44130a0ac42e4893954e8cd3b8ac2a2 100644
--- a/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.h
+++ b/alib2algo/src/string/properties/ReversedBadCharacterShiftTable.h
@@ -26,13 +26,13 @@ namespace properties {
  * Computation of BCS table for BMH from MI(E+\eps)-EVY course 2014
  * To get rid of zeros in BCS table we ignore last haystack character
  */
-class ReversedBadCharacterShiftTable : public std::SingleDispatch < ReversedBadCharacterShiftTable, std::map < alphabet::Symbol, size_t >, const string::StringBase & > {
+class ReversedBadCharacterShiftTable : public std::SingleDispatch < ReversedBadCharacterShiftTable, std::map < DefaultSymbolType, size_t >, const string::StringBase & > {
 public:
 	/**
 	 * Search for pattern in linear string.
 	 * @return set set of occurences
 	 */
-	static std::map < alphabet::Symbol, size_t > bcs ( const string::String & pattern );
+	static std::map < DefaultSymbolType, size_t > bcs ( const string::String & pattern );
 
 	template < class SymbolType >
 	static std::map < SymbolType, size_t > bcs ( const string::LinearString < SymbolType > & pattern );