Publication

Date Item Type Full Text Status

Article

Linear analysis of genetic algorithms. (1998) L.M. Schmitt, C.L. Nehaniv and R.H. Fujii

An assertion concerning functionally complete algebras and NP-completeness. (2008) G. Horvath, C.L. Nehaniv and C. Czabo

CSP duality and trees of bounded pathwidth. (2010) Catarina Carvalho, Víctor Dalmau and Andrei Krokhin picture_as_pdf

A scalable approach to computing representative lowest common ancestor in directed acyclic graphs. (2013) Santanu Dash, Sven-Bodo Scholz, Stephan Herhut and B. Christianson

On complete systems of automata. (2000) P. Domosi and C.L. Nehaniv

Finite Semigroups, Feedback, and the Letichevsky Criteria for Non-Empty Words in Finite Automata. (2003) P. Domosi, C.L. Nehaniv and J.L. Rhodes