State Complexity For Prefix, Suffix and Bifix operators on regular languages. - Citegraph

Paper Info

Title
State Complexity For Prefix, Suffix and Bifix operators on regular languages.

Year	Venue	Field
2009	ICTCS	Suffix,Computer science,State complexity,Arithmetic,Prefix,Operator (computer programming),Regular language
DocType	Citations	PageRank
Conference	0	0.34
References	Authors
0	2

Authors (2 rows)

Cited by (0 rows)

References (0 rows)

Name	Order	Citations	PageRank
Elena V. Pribavkina	1	52	9.22
Emanuele Rodaro	2	55	15.63

1