Theory of general linear automata Export

@article{citeulike:4053729, abstract = {Linear and affine automata are considered in their general form. The concept of dimensions of a finite automaton is introduced and finite automata of maximal dimensions are shown to be possible. The state reachability problem in monomial form is proved to be undecidable for two-dimensional affine automata. An analogue of Moore's theorem and theorems on homogenous and diagnostic words are also proved. An application of linear automata to mathematical economics is considered.}, author = {Rystsov, I.}, citeulike-article-id = {4053729}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10559-009-9082-8}, citeulike-linkout-1 = {http://www.springerlink.com/content/6172052606770572}, doi = {10.1007/s10559-009-9082-8}, journal = {Cybernetics and Systems Analysis}, keywords = {automata}, posted-at = {2009-02-22 02:52:23}, priority = {2}, title = {Theory of general linear automata}, url = {http://dx.doi.org/10.1007/s10559-009-9082-8} }

TY - JOUR ID - citeulike:4053729 L3 - citeulike-article-id:4053729 N2 - Linear and affine automata are considered in their general form. The concept of dimensions of a finite automaton is introduced and finite automata of maximal dimensions are shown to be possible. The state reachability problem in monomial form is proved to be undecidable for two-dimensional affine automata. An analogue of Moore's theorem and theorems on homogenous and diagnostic words are also proved. An application of linear automata to mathematical economics is considered. JF - Cybernetics and Systems Analysis TI - Theory of general linear automata KW - automata AU - Rystsov, I UR - http://dx.doi.org/10.1007/s10559-009-9082-8 ER -