Yannick Guesnet On Maximal Dense Bifix Codes. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:263-273 [Journal]
Pierre-Cyrille Héam Some Topological Properties of Rational Sets. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:275-290 [Journal]
Rainer Kemp On the Expected Number of Leftist Nodes in Simply Generated Trees. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:313-343 [Journal]
Erkki Mäkinen On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:351-357 [Journal]
Friedrich Otto, Nikola Ruskuc Confluent Monadic String-Rewriting Systems and Automatic Structures. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:375-388 [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
