A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
In accordance with the concept of automaton with the output we have built the language transformation schema E (see  ). In this paper we study the relation between the automata complexity g(E), the number of essential vertices lEI and the depth of operations 5 on a language transformation schema. The estimation of the automata complexity of a language transformation schema that holds operations with restricted degree is also given. Tom t~t. Du'a tren kh ai n iern 0 to mat co loi ra, ta xaydoi:10.15625/1813-9663/17/2/2442 fatcat:aliuydfm7jgczkymelbkkyk4iy