SOME RESULTS ON REGULAR EXPRESSIONS FOR MULTITAPE FINITE AUTOMATA

Author(s)

SOME RESULTS ON REGULAR EXPRESSIONS FOR MULTITAPE FINITE AUTOMATA Tigran Grigoryan

We consider sets of word tuples accepted by multitape finite automata. We use the known notation for regular expressions that describes languages accepted by one-tape automata. Nevertheless, the interpretation of the "concatenation" operation is different in this case. The algebra of events for multitape finite automata is defined in the same way as for one-tape automata. It is shown that the introduced algebra is a Kleene algebra. It is also, shown that some known results for the algebra of events accepted by one-tape finite automata are valid in this case too.

DOI: 10.46991/PYSU:A/2019.53.2.082 Physical and Mathematical Sciences, 53(2 (249) 82-90

Download PDF

Keywords

regular expressions, algebra of events, multitape finite automata

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]