Automata Networks without any Letichevsky Criteria
| dc.contributor.author | Dömösi, Pál | |
| dc.contributor.bookeditor | Ésik, Zoltán | |
| dc.contributor.bookeditor | Fülöp, Zoltán | |
| dc.date.accessioned | 2012-09-13T15:51:23Z | |
| dc.date.available | 2012-09-13T15:51:23Z | |
| dc.date.issued | 2012-09-13 | |
| dc.date.year | 2009 | |
| dc.description.abstract | In this paper we investigate some properties of the class of finite automata without any Letichevsky criteria. By our observations, we give a characterization of certain automata networks having very simple communication links. | en_US |
| dc.format.firstpage | 39 | en_US |
| dc.format.lastpage | 54 | en_US |
| dc.format.pages | 16 | en_US |
| dc.identifier.isbn | 978-963-482-916-4 | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/146 | |
| dc.language.iso | en | en_US |
| dc.publisher.place | Szeged | en_US |
| dc.publisher.publisher | Institute of Informatics, University of Szeged, Hungary | en_US |
| dc.subject | Finite automata | en_US |
| dc.subject | Letichevsky criterion | en_US |
| dc.title | Automata Networks without any Letichevsky Criteria | en_US |
| dc.title.book | Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday | en_US |
| dc.type.class | Monograph | en_US |
| dc.type.specification | Scientific | en_US |