| Form of presentation | Articles in international journals and collections |
| Year of publication | 2001 |
| Язык | английский |
|
Gaynutdinova Aida Faritovna, author
|
| Bibliographic description in the original language |
F. Ablayev, A. Gainutdinova, On the Lower Bounds for One-Way Quantum Automata // Proceedings of the 25th International Symposium, Mathematical Foundations of Computer Science (MFCS'2000, Bratislava). -Springer-Verlag. - V. 1893. - 2000. - P. 132-140. |
| Keywords |
конечные автоматы, сложность вычислений |
| The name of the journal |
Mathematical Foundations of Computer Science
|
| Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=123921&p_lang=2 |
Full metadata record  |
| Field DC |
Value |
Language |
| dc.contributor.author |
Gaynutdinova Aida Faritovna |
ru_RU |
| dc.date.accessioned |
2001-01-01T00:00:00Z |
ru_RU |
| dc.date.available |
2001-01-01T00:00:00Z |
ru_RU |
| dc.date.issued |
2001 |
ru_RU |
| dc.identifier.citation |
F. Ablayev, A. Gainutdinova, On the Lower Bounds for One-Way Quantum Automata // Proceedings of the 25th International Symposium, Mathematical Foundations of Computer Science (MFCS'2000, Bratislava). -Springer-Verlag. - V. 1893. - 2000. - P. 132-140. |
ru_RU |
| dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=123921&p_lang=2 |
ru_RU |
| dc.description.abstract |
Mathematical Foundations of Computer Science |
ru_RU |
| dc.language.iso |
ru |
ru_RU |
| dc.subject |
конечные автоматы |
ru_RU |
| dc.subject |
сложность вычислений |
ru_RU |
| dc.title |
On the Lower Bounds for One-Way Quantum Automata |
ru_RU |
| dc.type |
Articles in international journals and collections |
ru_RU |
|