The simple deterministic grammar (s-grammar) is the standard form grammar in which the handles of the Z-rules are distinct for each nonterminal symbol Z. The language generated by an s-grammar is called the simple deterministic language (s-language). It is known that the s-languages have the the prefix property and that their equivalence problem is solvable. (Korenjak and Hopcroft, 1966). Using...

Abstract In 1909 Borel defined normality as a notion of randomness the digits representation real number over certain base (fractional expansion). If we think an infinite sequence symbols from finite alphabet A , can define directly for words : word x is normal to if every block appears with same asymptotic frequency in other length. Many examples have been found since its definition, being Cha...