SOME RESULTS ON REGULAR EXPRESSIONS FOR MULTITAPE FINITE AUTOMATA
DOI:
https://doi.org/10.46991/PYSU:A/2019.53.2.082Keywords:
regular expressions, algebra of events, multitape finite automataAbstract
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.
Downloads
Published
2019-08-15
How to Cite
Grigoryan, T. (2019). SOME RESULTS ON REGULAR EXPRESSIONS FOR MULTITAPE FINITE AUTOMATA. Proceedings of the YSU A: Physical and Mathematical Sciences, 53(2 (249), 82–90. https://doi.org/10.46991/PYSU:A/2019.53.2.082
Issue
Section
Mathematics
License
Copyright (c) 2019 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.