Esko Ukkonen Lower Bounds on the Size of Deterministic Parsers. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1983, v:26, n:2, pp:153-170 [Journal]
Maurice Tchuente Computation of Boolean Functions on Networks of Binary Automata. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1983, v:26, n:2, pp:269-277 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP