|
|
Publications in Math-Net.Ru
-
EE-Stability and Promise in Behavior of Dynamic Deductive Data Bases
Keldysh Institute preprints, 1995, 118
-
On the general notion of complexity of derivation in a context-free grammar
Dokl. Akad. Nauk SSSR, 214:2 (1974), 257–260
-
On domination density
Dokl. Akad. Nauk SSSR, 204:3 (1972), 525–528
-
The theory of formal grammars
Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 10 (1972), 107–142
-
Density of a Derivation Tree and the Active Capacity of a Grammar
Probl. Peredachi Inf., 8:4 (1972), 88–98
-
Density: A Measure of Derivation Complexity in a Context-Free Grammar
Probl. Peredachi Inf., 8:2 (1972), 90–102
-
Languages of limited active capacity
Dokl. Akad. Nauk SSSR, 192:5 (1970), 966–968
-
The correlation between the class of all context-free languages
and the class of deterministic context-free languages
Algebra Logika, 8:1 (1969), 44–64
-
The minimization of a certain complexity function in the class of
${\rm MP}$-automata, and categorial grammars of complexity three
Algebra Logika, 7:3 (1968), 23–37
-
Mikhail Abramovich Taitslin (1936–2013)
Sib. Èlektron. Mat. Izv., 10 (2013), 54–65
-
Рецензия на книгу А. В. Гладкого “Математическая логика”
Math. Ed., 2000, no. 1(12), 30–33
© , 2026