|
|
|
|
Список литературы
|
|
| |
| 1. |
Anderson J. W. et al., “Quantifying variances in comparative RNA secondary structure prediction”, BMC bioinformatics, 14:1 (2013)   |
| 2. |
Mendelzon A., Wood P., “Finding Regular Simple Paths in Graph Databases”, SIAM J. Computing, 24:6 (1995), 1235-1258   |
| 3. |
Zhang Q., Su Z., “Context-sensitive data-dependence analysis via linear conjunctive language reachability”, Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017, 344-358 |
| 4. |
Кознов Д. В., Ларчик Е. В., Терехов А. Н., “Трансформация динамических представлений в предметно-ориентированном визуальном моделировании”, Программирование, 41:4 (2015), 3-12 ; Koznov D. V., Larchik E. V., Terekhov A. N., “View to view transformations in domain specific modeling”, Programming and Computer Software, 41:4 (2015), 208-214 |
| 5. |
Hellings J., “Conjunctive context-free path queries”, Proc. of ICDT’14, 2014, 119-130 |
| 6. |
Okhotin A., “Conjunctive grammars”, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519-535 |
| 7. |
Abiteboul S., Vianu V., “Regular path queries with constraints”, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1997, 122-133 |
| 8. |
Fan W., Li J., Ma S., Tang N, Wu Y., “Adding regular expressions to graph reachability and pattern queries”, 27th Data Engineering International Conference, 2011, 39-50 |
| 9. |
Nolé M., Sartiani C., “Regular path queries on massive graphs”, Proceedings of the 28th International Conference on Scientific and Statistical Database Management, 2016 |
| 10. |
Reutter J., Romero M., Vardi M., “Regular queries on graph databases”, Theory of Computing Systems, 61:1 (2017), 31-83 |
| 11. |
Azimov R. Sh., Grigorev S. V., Context-Free Path Querying by Matrix Multiplication, 2017, arXiv: 1707.01007v2 |
| 12. |
Sevon P., Eronen L., “Subgraph queries by context-free grammars”, Journal of Integrative Bioinformatics, 5:2 (2008) |
| 13. |
Zhang X. et al., “Context-free path queries on RDF graphs”, International Semantic Web Conference, 2016, 632-648 |
| 14. |
Abiteboul S., Hull R., Vianu V., Foundations of databases: the logical level, Addison-Wesley Longman Publishing Co., Inc., 1995 |
| 15. |
Chomsky N., “On certain formal properties of grammars”, Information and control, 2:2 (1959), 137-167 |
| 16. |
Kasami T., An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages, Report of University of Hawaii, Contract No. AF 19(628)-4379, No. 2, July, 1965 |
| 17. |
Younger D. H., “Recognition and parsing of context-free languages in time $n^3$”, Information and control, 10:2 (1967), 189-208 |
| 18. |
Grune D., Jacobs C. J. H., Parsing Techniques, Monographs in Computer Science, Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006 |
| 19. |
Valiant L. G., “General context-free recognition in less than cubic time”, Journal of computer and system sciences, 10:2, 308-315 |
| 20. |
Okhotin A., “Conjunctive and Boolean grammars: the true general case of the context-free grammars”, Computer Science Review, 9 (2013), 27-59 |
| 21. |
Che S., Beckmann B. M., Reinhardt S. K., “Programming GPGPU Graph Applications with Linear Algebra Building Blocks”, International Journal of Parallel Programming, 45:3, June (2017), 657-679 |
| 22. |
Syme D., Granicz A., Cisternino A., Expert F# 3.0, Springer, 2012 |
| 23. |
The Math.Net Numerics WebSite: https://numerics.mathdotnet.com/ (20.03.2018) |
| 24. |
The managedCuda library: https://kunzmi.github.io/managedCuda/ (20.03.2018) |
| 25. |
Hellings J., “Querying for Paths in Graphs using Context-Free Path Queries”, 2015, arXiv: 1502.02242 |
| 26. |
Okhotin A., “Boolean grammars”, Information and Computation, 194:1 (2004), 19-48 |
| 27. |
Okhotin A., “Parsing by matrix multiplication generalized to Boolean grammars”, Theoretical Computer Science, 516 (2014), 101-120 |
