К вопросу об автоматной сложности языков и сложности распознавания по Лавленду

Ф.М. Аблаев

Verojatnostnye metody i kibernetika (1983)

  • Volume: 19, page 3-9
  • ISSN: 0132-2869

How to cite

top

Аблаев, Ф.М.. "К вопросу об автоматной сложности языков и сложности распознавания по Лавленду." Verojatnostnye metody i kibernetika 19 (1983): 3-9. <http://eudml.org/doc/69221>.

@article{Аблаев1983,
author = {Аблаев, Ф.М.},
journal = {Verojatnostnye metody i kibernetika},
keywords = {automata complexity; Loveland complexity; recursive languages; effective enumeration},
language = {rus},
pages = {3-9},
publisher = {Izd. Kazanskogo universiteta},
title = {К вопросу об автоматной сложности языков и сложности распознавания по Лавленду},
url = {http://eudml.org/doc/69221},
volume = {19},
year = {1983},
}

TY - JOUR
AU - Аблаев, Ф.М.
TI - К вопросу об автоматной сложности языков и сложности распознавания по Лавленду
JO - Verojatnostnye metody i kibernetika
PY - 1983
PB - Izd. Kazanskogo universiteta
VL - 19
SP - 3
EP - 9
LA - rus
KW - automata complexity; Loveland complexity; recursive languages; effective enumeration
UR - http://eudml.org/doc/69221
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.