CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Some complexity results for polynomial rational expressions
Theoretical Computer Science
Theoretical Computer Science
Note: On the complexity of computing the profinite closure of a rational language
Theoretical Computer Science
Hi-index | 0.00 |