Preview

Моделирование и анализ информационных систем

Расширенный поиск

МП-автоматы с независимыми счётчиками

https://doi.org/10.18255/1818-1015-2015-2-176-196

Полный текст:

Об авторах

Михаил Иосифович Дехтярь
Тверской государственный университет
Россия
д-р физ.-мат. наук, доцент, 170000 Россия, г. Тверь, ул. Желябова, 33


Борис Николаевич Карлов
Тверской государственный университет
Россия
канд. физ.-мат. наук, 170000 Россия, г. Тверь, ул. Желябова, 33


Список литературы

1. Bar-Hillel Y., Gaifman H., Shamir E., “On categorial and phrase structure grammars”, Bull. Res. Council Israel, 9F (1960), 1–16.

2. Dekhtyar M., Dikovsky A., “Categorial dependency grammars”, Proc. of Int. Conf. on Categorial Grammars, 2004, 76–91.

3. Dekhtyar M., Dikovsky A., “Generalized categorial dependency grammars”, Pillars of Compute Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, LNCS, 4800, 2008, 230–255.

4. Dekhtyar M., Dikovsky A., Karlov B., “Iterated dependencies and Kleene iteration”, Proc. of the 15th Conference on Formal Grammar (FG 2010), LNCS, 7395, Copenhagen, Denmark, 2012, 66–81.

5. Dikovsky A., “Grammars for local and long dependencies”, In Proc. of the Intern. Conf. ACL’2001, 2001, 156–163.

6. Dikovsky A., “Dependencies as categories”, Proc. of Workshop Recent Advances in Dependency Grammars”. In conjunction with COLING 2004, 2004, 90–97.

7. Dikovsky A., “Proc. of the 12th Conference on Formal Grammar”, 2007, 1–12.

8. Ginsburg S., Greibach S., “Abstract families of languages”, Mem. Amer. Math. Soc., 1969, № 87, 1–32.

9. Greibach S., “A new normal-form theorem for context-free phrase structure grammars”, Journal of the ACM, 12 (1965), 42–52.

10. Hack M., “Petri Net Languages”, MIT, Lab. for Computer Science, Technical Report 159, 1976.

11. Hopcroft J., Ullman J., Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.

12. Kallmeyer L., Parsing Beyond Context-Free Grammars, Cognitive Technologies, SpringerVerlag, Berlin Heidelberg, 2010.

13. Joshi A., Levy L., Takahashi M., “Tree adjunct grammar”, Journal of Computer and System Sciences, 1975, № 10(1), 136–163.

14. Kanazawa M., Salvati S., “Mix is not a tree-adjoining language”, The 50th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference: Long Papers, 1, Jeju Island, Korea, 2012, 666–674.

15. Karlov B., “Abstract automata and a normal form for categorial dependency grammars”, Proc. of the 7th International Conference on Logical Aspects of Computational Linguistics (LACL 2012), LNCS, 7351, Nantes, France, 2012, 86–102.

16. Søgaard A., “A linear time extension of deterministic push-down automata”, Proc. of the 17th Nordic Conference of Computational Linguistics NODALIDA 2009, NEALT Proceedings Series, 4, eds. K. Jokinen, E. Bick, 2009, 182–189.

17. Tesni`ere L., El´ements de syntaxe structurale. Librairie C ´ , Klincksieck, Paris, 1959.

18. Vijay-Shanker K., A Study of Tree Adjoining Grammars, Ph.D. thesis, University of Pennsylvania, 1987.

19. Vijay-Shanker K., Weir D. J., “The equivalence of four extensions of context-free grammars”, Mathematical Systems Theory, 1994, № 27(6), 511–546.

20. Gladkiy A. V., Formalnye grammatiki i yazyki, Nauka, Moskva, 1973, (in Russian).

21. Karlov B. N., “Normalnye formy i avtomaty dlya kategorialnykh grammatik zavisimostey”, Vestnik Tverskogo gosudarstvennogo universiteta, “Prikladnaya matematika”, 2008, 23–43, (in Russian).


Рецензия

Для цитирования:


Дехтярь М.И., Карлов Б.Н. МП-автоматы с независимыми счётчиками. Моделирование и анализ информационных систем. 2015;22(2):176-196. https://doi.org/10.18255/1818-1015-2015-2-176-196

For citation:


Dekhtyar M., Karlov B. PDA with Independent Counters. Modeling and Analysis of Information Systems. 2015;22(2):176-196. https://doi.org/10.18255/1818-1015-2015-2-176-196

Просмотров: 931


Creative Commons License
Контент доступен под лицензией Creative Commons Attribution 4.0 License.


ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)