F. M. Ablayev, “Metrization criterion for regularity of languages representable in countable automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, Number 9,Pages <nobr>67

JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 1982 Number 9, Pages 67–69 (Mi ivm6882)

Brief communications

Metrization criterion for regularity of languages representable in countable automata

F. M. Ablayev

UDC: 519.68

Received: 20.11.1981

Fulltext: PDF file (297 kB)

Bibliographic databases: