Equivalence of regular expressions over a partially commutative alphabet
- 21 Downloads
The equivalence problem is considered for regular expressions over a partially commutative alphabet. The alphabet is decomposed into disjoint subsets of noncommutative elements. The special case of the problem when the cardinal number of only one subset is larger than 1 and the cardinal numbers of the other subsets are equal to 1 is proved to be algorithmically solvable.
Keywordsregular expression partially commutative alphabet automaton equivalence
Unable to display preview. Download preview PDF.
- 1.A. V. Aho and J. D. Ullman, Theory of Parsing, Translation, and Compiling [Rusian translation], Vol. 1, Mir, Moscow (1978).Google Scholar
- 3.V. A. Tuzov, “Decision problems for graph schemata with permutable operators. II,” Cybernetics, No. 5, 778–789 (1971).Google Scholar
- 5.C. Preston, “The Algebraic Theory of Semigroups,” Amer. Math. Soc., No. 7, 148–159 (1961).Google Scholar
- 6.A. B. Godlevskii, A. A. Letichevskii, and S. K. Shukuryan, “Reducibility of program-scheme functional equivalence on a nondegenerate basis of rank unity to the equivalence of automata with multidimensional tapes,” Cybernetics, No. 6, 793–799 (1980).Google Scholar