|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 6, Pages 23–31
(Mi ivm6942)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Finite transducers and nondeterministic state complexity of regular languages
G. A. Povarov Chair of Algebra and Discrete Mathematics, Ural State University, Ekaterinburg, Russia
Abstract:
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.
Received: 25.05.2008
Citation:
G. A. Povarov, “Finite transducers and nondeterministic state complexity of regular languages”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 6, 23–31; Russian Math. (Iz. VUZ), 54:6 (2010), 19–25
Linking options:
https://www.mathnet.ru/eng/ivm6942 https://www.mathnet.ru/eng/ivm/y2010/i6/p23
|
Statistics & downloads: |
Abstract page: | 463 | Full-text PDF : | 218 | References: | 49 | First page: | 6 |
|