Geodesic
Finite transducers and nondeterministic state complexity of regular languages
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2010), pp. 23-31

Voir la notice de l'article provenant de la source Math-Net.Ru

We obtain a sharp upper bound for the nondeterministic state complexity of the application of a finite transducer to a regular language.
Keywords: finite transducer, nondeterministic finite automaton, regular language, descriptive complexity, nondeterministic state complexity. 
@article{IVM_2010_6_a2,
     author = {G. A. Povarov},
     title = {Finite transducers and nondeterministic state complexity of regular languages},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {23--31},
     publisher = {mathdoc},
     number = {6},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2010_6_a2/}
}
TY  - JOUR
AU  - G. A. Povarov
TI  - Finite transducers and nondeterministic state complexity of regular languages
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2010
SP  - 23
EP  - 31
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2010_6_a2/
LA  - ru
ID  - IVM_2010_6_a2
ER  - 
%0 Journal Article
%A G. A. Povarov
%T Finite transducers and nondeterministic state complexity of regular languages
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2010
%P 23-31
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2010_6_a2/
%G ru
%F IVM_2010_6_a2
G. A. Povarov. Finite transducers and nondeterministic state complexity of regular languages. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2010), pp. 23-31. http://geodesic.mathdoc.fr/item/IVM_2010_6_a2/