On the complexity of intersecting finite state automata and NL versus NP

Author： Karakostas G.   Lipton R.J.   Viglas A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 257-274

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

ROUGH FINITE-STATE AUTOMATA

By BASU SUMITA  

Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. : 107-124

Taylor & Francis Ltd

Access to resources Recommend Favorite

SetExp : a method of transformation of timed automata into finite state automata

By Ouedraogo Lucien  

Real-Time Systems, Vol. 46, Iss. 2, 2010-10 ,pp. : 189-250

Springer Publishing Company

Access to resources Recommend Favorite

Methods of constructing universal tests for finite-state automata

By Tverdokhlebov V.  

Automation and Remote Control, Vol. 66, Iss. 1, 2005-01 ,pp. : 139-147

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Representation of Finite State Automata in Recurrent Radial Basis Function Networks

By Frasconi P.   Gori M.   Maggini M.   Soda G.  

Machine Learning, Vol. 23, Iss. 1, 1996-04 ,pp. : 5-32

Springer Publishing Company

Access to resources Recommend Favorite

A Novel Approach in Adopting Finite State Automata for Image Processing Applications

By  

International Journal of Computer Vision and Image Processing (IJCVIP), Vol. 8, Iss. 1, 2018-01 ,pp. : 59-74

IGI Global_journal

Access to resources Recommend Favorite