Paper Info
Title
State complexity of prefix, suffix, bifix and infix operators on regular languages
Abstract
We consider four operators on a regular language. Each of them is a tool for constructing a code (respectively prefix, suffix, bifix and infix) out of a given regular language. We give the precise values of the (deterministic) state complexity of each of these operators.
Year
DOI
Venue
2010
10.1007/978-3-642-14455-4_34
Developments in Language Theory
Keywords
Field
DocType
infix operator,state complexity,precise value,regular language
Discrete mathematics,Suffix,Computer science,State complexity,Arithmetic,Prefix,Infix,Operator (computer programming),Regular language,Code (cryptography)
Conference
Volume
ISSN
ISBN
6224
0302-9743
3-642-14454-3
Citations 
PageRank 
References 
2
0.44
16
Authors
2
Name
Order
Citations
PageRank
Elena V. Pribavkina1529.22
Emanuele Rodaro25515.63