The news correspondents obtained a quote from the research from the
According to the news reporters, the research concluded: "Finally, a procedure for deciding obliviousness of an arbitrary 2DFA is given and, moreover, the problem is shown to be PSPACE-complete."
For more information on this research see: Oblivious two-way finite automata: Decidability and complexity. Information and Computation, 2014;237():294-302. Information and Computation can be contacted at: Academic Press Inc Elsevier Science,
Our news journalists report that additional information may be obtained by contacting M. Kutrib,
Keywords for this news article include:
Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC
Hispanic #1 Breaking News for Entrepreneurs, Professionals and Small Business Owners - HispanicBusiness.com
OCTOBER 31, 2014
|Customer Service||Policy||Advertise||Site Tools|
|HispanicBusiness Services||Editorial Guidelines||Ad Specifications||Magazine Archive|
|List Rental Agreement||About Us||Media Kits||Post Your Event|
|HireDiversity Job Search||Editorial Calendar||Research|
© 2014 HispanicBusiness Inc. All Rights Reserved.