Automata Networks without any Letichevsky Criteria

dc.contributor.authorDömösi, Pál
dc.contributor.bookeditorÉsik, Zoltán
dc.contributor.bookeditorFülöp, Zoltán
dc.date.accessioned2012-09-13T15:51:23Z
dc.date.available2012-09-13T15:51:23Z
dc.date.issued2012-09-13
dc.date.year2009
dc.description.abstractIn 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.firstpage39en_US
dc.format.lastpage54en_US
dc.format.pages16en_US
dc.identifier.isbn978-963-482-916-4en_US
dc.identifier.urihttp://hdl.handle.net/123456789/146
dc.language.isoenen_US
dc.publisher.placeSzegeden_US
dc.publisher.publisherInstitute of Informatics, University of Szeged, Hungaryen_US
dc.subjectFinite automataen_US
dc.subjectLetichevsky criterionen_US
dc.titleAutomata Networks without any Letichevsky Criteriaen_US
dc.title.bookAutomata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthdayen_US
dc.type.classMonographen_US
dc.type.specificationScientificen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Gécsegproftiszteletére.pdf
Size:
150.96 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.57 KB
Format:
Item-specific license agreed upon to submission
Description: