{'fraction_non_alphanumeric': 0.006263048016701462, 'fraction_numerical': 0.0, 'mean_word_length': 5.575342465753424, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Essential properties of dynamic programming structure in decision processes

Some types of sequential decision processes for which the dynamic programming equation can be established are examined. Representation theorems of discrete decision process by these sequential decision processes are proved. It is shown that a certain chain property and two kinds of weak chain properties are essential for a sequential decision processes to be one with a dynamic programming structure.