MATEC Web of Conferences
Volume 41, 20161st Mini Conference on Emerging Engineering Applications (MCEEA’15)
|Number of page(s)||4|
|Section||Algorithms and Applications|
|Published online||01 February 2016|
On path hypercompositions in graphs and automata
Technological Institute of Sterea Hellas, Evia GR, 34400, Greece
a Corresponding author: Ch.Massouros@gmail.com
The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.