Pre-automata as Mathematical Models of Event Flows Recognisers

dc.contributor.author	Novikov, B.V.
dc.contributor.author	Perepelytsya, I.D.
dc.contributor.author	Zholtkevych, G.M.
dc.date.accessioned	2011-05-07T08:52:13Z
dc.date.available	2011-05-07T08:52:13Z
dc.date.issued	2011-04-27
dc.description.abstract	The new class of recognisers is introduced and studied in the paper. The models are based on the notion of partial action of a free nite generated monoid. Authors called such models by preautomata. Some properties of preautomata were established and proved in the paper. These properties allow to consider the pre-automata as mathematical models of recognizers of event ows in processes of the interaction of software systems.	en
dc.identifier.citation	Proceedings of the 7th International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer (ICTERI 2011), Kherson, Ukraine, May 4-7, 2011. - P. 41 - 50	en
dc.identifier.issn	ISSN 1613-0073
dc.identifier.uri	https://ekhnuir.karazin.ua/handle/123456789/2567
dc.language.iso	en	en
dc.publisher	CEURS-WS	en
dc.relation.ispartofseries	V. 716;6
dc.subject	Discrete Mathematics	en
dc.subject	Theoretical Computer Science	en
dc.title	Pre-automata as Mathematical Models of Event Flows Recognisers	en
dc.type	Article	en

Файли

Зараз показуємо 1 - 1 з 1

Зараз показуємо 1 - 1 з 1