Author： Blinovsky V.
Publisher： MAIK Nauka/Interperiodica
ISSN： 0032-9460
Source： Problems of Information Transmission, Vol.47, Iss.1, 2011-03, pp. : 34-45
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A decomposition theorem for finite persistent transition systems
By Best Eike
Acta Informatica, Vol. 46, Iss. 3, 2009-05 ,pp. :
Access to resources
Recommend
Regular closed sets of permutations
By Albert M.H. Atkinson M.D. Ruskuc N.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Lyndon words, permutations and trees
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
The intersection of retracts of A *
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Routing Permutations on Graphs via Factors
Journal of Parallel and Distributed Computing, Vol. 54, Iss. 2, 1998-11 ,pp. :