Mirkin B. G.. Novyj algoritm postroéniá bazisa v ázyké régularnyh vyražénij. Izvéstiá Akadémii Nauk SSSR, Téchničeskaá Kibérnétika, no. 5 , pp. 113–119.Mirkin B. G.. An algorithm for constructing a base in a language of regular expressions. English translation of the preceding. Engineering cybernetics, no. 5 , pp. 110–116 [Book Review]

Journal of Symbolic Logic 36 (4):694-694 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272532

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

M. A. Spivak. Algoritm abstraktnogo sintéza avtomatov dla rasširènnogo ázyka régulàrnyh vyražénij. Izvéstiá Akadémii Nauk SSSR, téhničéskaá kibérnétika, no. 1 , pp. 51–57. - M. A. Spivak. Algorithm for abstract synthesis of automata for an expanded language of regular expressions. English translation of the preceding. Engineering cybernetics, no. 1 , pp. 43–49. [REVIEW]J. A. Brzozowski - 1972 - Journal of Symbolic Logic 37 (3):620-620.
Review: B. G. Mirkin, An Algorithm for Constructing a Base in a Language of Regular Expressions. [REVIEW]J. A. Brzozowski - 1971 - Journal of Symbolic Logic 36 (4):694-694.
An Algorithm for Constructing a Base in a Language of Regular Expressions.B. G. Mirkin - 1971 - Journal of Symbolic Logic 36 (4):694-694.
Šéstakov V. I.. Predstavlénié haraktéristiçeskih funkcij prédložénif posrédstvom vyražénij, réalizuémyh réléjno-kontaktnymi shémami . Russian with English summary. Izvéstiá Akadémii Nauk SSSR , Sérià matématiěskaá , vol. 10 , pp. 529–554. [REVIEW]Andrzej Mostowski - 1947 - Journal of Symbolic Logic 12 (4):135-135.
Review: B. G. Mirkin, On a Language of Pseudo-Regular Expressions. [REVIEW]J. A. Brzozowski - 1969 - Journal of Symbolic Logic 34 (4):658-658.
I. Žuravlév Ú.. O névozmožnosti postroéniá minimal'nyh dizúnktivnyh normal'nyh form funkcij algébry logiki v odnom kassé algoritmov. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 504–506.Žuravlev Yu. I.. On the impossibility of constructing minimal disjunctive normal forms for functions of the algebra of logic in a single class of algorithms. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 581–583. [REVIEW]Andrzej Rowicki - 1965 - Journal of Symbolic Logic 30 (3):379-379.
Ostianu V. M.. O sintézé kontaktnyh shém s šagovymi péréklúčatélámi. Doklady Akadémii Nauk SSSR, vol. 103 , pp. 827–830.Ostianu V. M.. On the synthesis of switching circuits with selector switches. English translation of the preceding. Multilith-offset. Morris D. Friedman, Inc., Needham Heights, Mass., c. 1957, 7 pp. [REVIEW]Edward F. Moore - 1959 - Journal of Symbolic Logic 24 (1):76-76.
B. G. Mirkin. O ázyké psévdorégulárnyh vyrazénij (On a language of pseudo-regular expressions). Kibérnétika (Kiev), no. 6 (1966), pp. 8–11. [REVIEW]B. G. Mirkin - 1970 - Journal of Symbolic Logic 34 (4):658-658.
A. D. Tajmanov. O klassé modéléj, zamknutom otnositél'no prámogo proizvédéniá . Doklady Akadémii Nauk SSSR, vol. 127 , pp. 1173–1175. - A. D. Tajmanov. O klassé modéléj, zamknutyh otnositél'no prámogo proizvédéniá . Izvéstiá Akadémii Nauk SSSR, Sériá matématičéskaá, vol. 24 , pp. 493–510. [REVIEW]Peter G. Hinman - 1965 - Journal of Symbolic Logic 30 (2):253-254.
Kabakov F. A.. O modélirovanii po réalizuémosti psévdobulévyh algébr. Doklady Akadémii Nauk SSSR, vol. 192 , pp. 16–18.Kabakov F. A.. On modelling of pseudo-Boolean algebras by realizability. English translation of the preceding by M. Machover. Soviet mathematics, vol. 11 no. 3 , pp. 562–564. [REVIEW]Gene F. Rose - 1972 - Journal of Symbolic Logic 37 (3):627-628.
Ánov Ú. I. and Mučnik A. A.. O suščéstvovanii k-značnyh zamknutyh klassov, né iméúščih konéčnogo bazisa . Doklady Akademii Nauk SSSR, vol. 127 , pp. 44–46. [REVIEW]Andrzej Mostowski - 1962 - Journal of Symbolic Logic 27 (2):247-248.
Ánkov V. A.. O rasširénii intuicionistskogo propozicional′nogo isčisléniá do klassičéskogo i minimal′nogo-do intuicionistskogo. Izvéstiá Akadémii Nauk SSSR, Séria matématičéskaá, vol. 32 , pp. 208–211.Jankov V. A.. On the extension of the intuitionist propositional calculus to the classical calculus, and the minimal calculus to the intuitionist calculus. English translation of the preceding. Mathematics of the USSR—Izvestija , vol. 2 no. 1 , pp. 205–208. [REVIEW]J. G. Anderson - 1973 - Journal of Symbolic Logic 38 (2):331-331.
Trahténbrot B. A.. Nékotoryé postroéniá v logiké odnoméstnyh. prédikatov . Doklady Akadémii Nauk SSSR vol. 138 , pp. 320–321. [REVIEW]Andrzej Mostowski - 1964 - Journal of Symbolic Logic 29 (2):100-100.
Markov A. A.. Ob invérsionnoj složnosti sistém funkcij. Doklady Akadémii Nauk SSSR, vol. 116 , pp. 917–919.Markov A. A.. On the inversion complexity of a system of functions. English translation of the preceding by Morris D. Friedman. Journal of the Association for Computing Machinery, vol. 5 , pp. 331–334. [REVIEW]E. N. Gilbert - 1965 - Journal of Symbolic Logic 30 (3):378-379.
Minc G. É.. Skolèmovskij métod eliminacii položitél'nyh kvantorov v sékvéncial'nyh isčisléniáh. Doklady Akadémii Nauk SSSR, vol. 169 , pp. 24–27.Minc G. E.. Skolem's method of elimination of positive quantifiers in sequential calculi. English translation of the preceding by Ebner L.. Soviet mathematics, vol. 7 no. 4 , pp. 861–864. [REVIEW]J. van Heijenoort - 1971 - Journal of Symbolic Logic 36 (3):526-527.

Analytics

Added to PP
2016-06-30

Downloads
9 (#1,224,450)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jerzy Brzozowski
Universidade Federal de Santa Catarina

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references