Beklemishev, Lev A note on strictly positive logics and word rewriting systems. (English) Zbl 1429.03077 Odintsov, Sergei (ed.), Larisa Maksimova on implication, interpolation, and definability. Cham: Springer. Outst. Contrib. Log. 15, 61-70 (2018). MSC: 03B45 68Q42 PDF BibTeX XML Cite \textit{L. Beklemishev}, Outst. Contrib. Log. 15, 61--70 (2018; Zbl 1429.03077) Full Text: DOI arXiv OpenURL
Huschenbett, Martin; Kuske, Dietrich; Zetzsche, Georg The monoid of queue actions. (English) Zbl 1400.68094 Semigroup Forum 95, No. 3, 475-508 (2017). MSC: 68Q42 03D03 20M20 20M32 20M35 PDF BibTeX XML Cite \textit{M. Huschenbett} et al., Semigroup Forum 95, No. 3, 475--508 (2017; Zbl 1400.68094) Full Text: DOI OpenURL
Halava, Vesa; Matiyasevich, Yuri; Niskanen, Reino Small semi-Thue system universal with respect to the termination problem. (English) Zbl 1420.03087 Fundam. Inform. 154, No. 1-4, 177-184 (2017). MSC: 03D03 03D35 PDF BibTeX XML Cite \textit{V. Halava} et al., Fundam. Inform. 154, No. 1--4, 177--184 (2017; Zbl 1420.03087) Full Text: DOI OpenURL
Martínez, Iveth; Piza, Eduardo Decision problems and recursiveness in formal logic systems. (Spanish. English summary) Zbl 1352.03049 Rev. Mat. Teor. Apl. 23, No. 1, 11-39 (2016). MSC: 03D80 03D03 03D25 03B05 PDF BibTeX XML Cite \textit{I. Martínez} and \textit{E. Piza}, Rev. Mat. Teor. Apl. 23, No. 1, 11--39 (2016; Zbl 1352.03049) OpenURL
Ernvall, Mari; Halava, Vesa; Harju, Tero On the \(n\)-permutation Post correspondence problem. (English) Zbl 1338.03074 Theor. Comput. Sci. 601, 15-20 (2015). MSC: 03D03 03D35 03D40 PDF BibTeX XML Cite \textit{M. Ernvall} et al., Theor. Comput. Sci. 601, 15--20 (2015; Zbl 1338.03074) Full Text: DOI OpenURL
Durand, I.; Sénizergues, G. Bottom-up rewriting for words and terms. (English) Zbl 1456.68072 J. Symb. Comput. 67, 93-121 (2015). MSC: 68Q42 03D03 PDF BibTeX XML Cite \textit{I. Durand} and \textit{G. Sénizergues}, J. Symb. Comput. 67, 93--121 (2015; Zbl 1456.68072) Full Text: DOI OpenURL
Halava, Vesa; Harju, Tero Word problem for deterministic and reversible semi-Thue systems. (English) Zbl 1361.03035 Semigroup Forum 88, No. 2, 468-478 (2014). MSC: 03D03 03D05 03D35 20M05 PDF BibTeX XML Cite \textit{V. Halava} and \textit{T. Harju}, Semigroup Forum 88, No. 2, 468--478 (2014; Zbl 1361.03035) Full Text: DOI OpenURL
Dong, Jing; Liu, Qinghui Undecidability of infinite Post correspondence problem for instances of size 8. (English) Zbl 1257.03069 RAIRO, Theor. Inform. Appl. 46, No. 3, 451-457 (2012). MSC: 03D35 03D03 03D40 68R15 PDF BibTeX XML Cite \textit{J. Dong} and \textit{Q. Liu}, RAIRO, Theor. Inform. Appl. 46, No. 3, 451--457 (2012; Zbl 1257.03069) Full Text: DOI Numdam EuDML OpenURL
Latteux, Michel; Roos, Yves On one-rule grid semi-Thue systems. (English) Zbl 1284.68329 Fundam. Inform. 116, No. 1-4, 189-204 (2012). MSC: 68Q42 03D03 PDF BibTeX XML Cite \textit{M. Latteux} and \textit{Y. Roos}, Fundam. Inform. 116, No. 1--4, 189--204 (2012; Zbl 1284.68329) Full Text: Link OpenURL
Kozhevnikov, A. A.; Nikolenko, S. I. On complete one-way functions. (English. Russian original) Zbl 1181.68144 Probl. Inf. Transm. 45, No. 2, 168-183 (2009); translation from Probl. Peredachi Inf. 45, No. 2, 101-118 (2009). MSC: 68P25 68Q42 94A60 PDF BibTeX XML Cite \textit{A. A. Kozhevnikov} and \textit{S. I. Nikolenko}, Probl. Inf. Transm. 45, No. 2, 168--183 (2009; Zbl 1181.68144); translation from Probl. Peredachi Inf. 45, No. 2, 101--118 (2009) Full Text: DOI OpenURL
Moczydłowski, Wojciech; Geser, Alfons Termination of single-threaded one-rule semi-Thue systems. (English) Zbl 1078.03034 Giesl, Jürgen (ed.), Term rewriting and applications. 16th international conference, RTA 2005, Nara, Japan, April 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25596-6/pbk). Lecture Notes in Computer Science 3467, 338-352 (2005). MSC: 03D03 68Q42 PDF BibTeX XML Cite \textit{W. Moczydłowski} and \textit{A. Geser}, Lect. Notes Comput. Sci. 3467, 338--352 (2005; Zbl 1078.03034) Full Text: DOI OpenURL
Kuske, Dietrich; Lohrey, Markus Decidable first-order theories of one-step rewriting in trace monoids. (English) Zbl 1061.68086 Theory Comput. Syst. 38, No. 1, 39-81 (2005). MSC: 68Q42 03B25 PDF BibTeX XML Cite \textit{D. Kuske} and \textit{M. Lohrey}, Theory Comput. Syst. 38, No. 1, 39--81 (2005; Zbl 1061.68086) Full Text: DOI Link OpenURL
Matiyasevich, Yuri; Sénizergues, Géraud Decision problems for semi-Thue systems with a few rules. (English) Zbl 1078.03033 Theor. Comput. Sci. 330, No. 1, 145-169 (2005). MSC: 03D03 68Q42 03D35 PDF BibTeX XML Cite \textit{Y. Matiyasevich} and \textit{G. Sénizergues}, Theor. Comput. Sci. 330, No. 1, 145--169 (2005; Zbl 1078.03033) Full Text: DOI OpenURL
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes Match-bounded string rewriting systems. (English) Zbl 1101.68048 Appl. Algebra Eng. Commun. Comput. 15, No. 3-4, 149-171 (2004). MSC: 68Q42 68T15 03B35 PDF BibTeX XML Cite \textit{A. Geser} et al., Appl. Algebra Eng. Commun. Comput. 15, No. 3--4, 149--171 (2004; Zbl 1101.68048) Full Text: DOI OpenURL
Geser, Alfons Loops of superexponential lengths in one-rule string rewriting. (English) Zbl 1045.68071 Tison, Sophie (ed.), Rewriting techniques and applications. 13th international conference, RTA 2002, Copenhagen, Denmark, July 22–24, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43916-1). Lect. Notes Comput. Sci. 2378, 267-280 (2002). MSC: 68Q42 PDF BibTeX XML Cite \textit{A. Geser}, Lect. Notes Comput. Sci. 2378, 267--280 (2002; Zbl 1045.68071) Full Text: Link OpenURL
Geser, Alfons Decidability of termination of grid string rewriting rules. (English) Zbl 1008.68063 SIAM J. Comput. 31, No. 4, 1156-1168 (2002). MSC: 68Q42 PDF BibTeX XML Cite \textit{A. Geser}, SIAM J. Comput. 31, No. 4, 1156--1168 (2002; Zbl 1008.68063) Full Text: DOI OpenURL
Loader, Ralph The undecidability of \(\lambda\)-definability. (English) Zbl 1031.03020 Anderson, C. Anthony (ed.) et al., Logic, meaning and computation. Essays in memory of Alonzo Church. Dordrecht: Kluwer Academic Publishers. Synth. Libr. 305, 331-342 (2001). MSC: 03B40 03D35 03D03 03D40 PDF BibTeX XML Cite \textit{R. Loader}, Synth. Libr. 305, 331--342 (2001; Zbl 1031.03020) OpenURL
McNaughton, Robert Semi-Thue systems with an inhibitor. (English) Zbl 0981.68073 J. Autom. Reasoning 26, No. 4, 409-431 (2001). MSC: 68Q42 68Q05 PDF BibTeX XML Cite \textit{R. McNaughton}, J. Autom. Reasoning 26, No. 4, 409--431 (2001; Zbl 0981.68073) Full Text: DOI OpenURL
Geser, A. On normalizing, non-terminating one-rule string rewriting systems. (English) Zbl 0944.68085 Theor. Comput. Sci. 243, No. 1-2, 489-498 (2000). MSC: 68Q42 PDF BibTeX XML Cite \textit{A. Geser}, Theor. Comput. Sci. 243, No. 1--2, 489--498 (2000; Zbl 0944.68085) Full Text: DOI OpenURL
Knapik, Teodor; Calbrix, Hugues The graphs of finite monadic semi-Thue systems have a decidable monadic second-order theory. (English) Zbl 0967.03008 Calude, C. S. (ed.) et al., Combinatorics, computation & logic. Proceedings of DMTCS ’99 and CATS ’99. Auckland, New Zealand, January 18-21, 1999. Singapore: Springer. Aust. Comput. Sci. Commun. 21, 3, 273-285 (1999). Reviewer: Magnus Steinby (Turku) MSC: 03B25 03D03 68Q42 PDF BibTeX XML Cite \textit{T. Knapik} and \textit{H. Calbrix}, in: Combinatorics, computation \& logic. Proceedings of DMTCS '99 and CATS '99. Auckland, New Zealand, January 18--21, 1999. Singapore: Springer. 273--285 (1999; Zbl 0967.03008) OpenURL
Lohrey, Markus Complexity results for confluence problems. (English) Zbl 0955.68063 Kutyłowski, Mirosław (ed.) et al., Mathematical foundations of computer science 1999. 24th international symposium, MFCS ’99, Szklarska Porȩba, Poland, September 6-10, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1672, 114-124 (1999). MSC: 68Q42 PDF BibTeX XML Cite \textit{M. Lohrey}, Lect. Notes Comput. Sci. 1672, 114--124 (1999; Zbl 0955.68063) OpenURL
De Luca, Aldo; Varricchio, Stefano Finiteness and regularity in semigroups and formal languages. (English) Zbl 0935.68056 EATCS Monographs on Theoretical Computer Science. Berlin: Springer. x, 240 p. (1999). Reviewer: S.Gerber (Leipzig) MSC: 68Q45 68R15 68-02 68Q42 PDF BibTeX XML Cite \textit{A. De Luca} and \textit{S. Varricchio}, Finiteness and regularity in semigroups and formal languages. Berlin: Springer (1999; Zbl 0935.68056) OpenURL
McNaughton, Robert Contributions of Ronald V. Book to the theory of string-rewriting systems. (English) Zbl 0913.68111 Theor. Comput. Sci. 207, No. 1, 13-23 (1998). MSC: 68Q42 PDF BibTeX XML Cite \textit{R. McNaughton}, Theor. Comput. Sci. 207, No. 1, 13--23 (1998; Zbl 0913.68111) Full Text: DOI OpenURL
Sénizergues, Géraud A polynomial algorithm testing partial confluence of basic semi-Thue systems. (English) Zbl 0908.68108 Theor. Comput. Sci. 192, No. 1, 55-75 (1998). MSC: 68Q45 68W10 PDF BibTeX XML Cite \textit{G. Sénizergues}, Theor. Comput. Sci. 192, No. 1, 55--75 (1998; Zbl 0908.68108) Full Text: DOI OpenURL
Madlener, K.; Reinert, B. A generalization of Gröbner basis algorithms to nilpotent group rings. (English) Zbl 0877.16012 Appl. Algebra Eng. Commun. Comput. 8, No. 2, 103-123 (1997). Reviewer: U.Kaljulaid (Tartu) MSC: 16S34 13P10 68W30 20C07 20F18 16D25 PDF BibTeX XML Cite \textit{K. Madlener} and \textit{B. Reinert}, Appl. Algebra Eng. Commun. Comput. 8, No. 2, 103--123 (1997; Zbl 0877.16012) Full Text: DOI OpenURL
Kurth, Winfried One-rule semi-Thue systems with loops of length one, two or three. (English) Zbl 0867.68064 RAIRO, Inform. Théor. Appl. 30, No. 5, 415-429 (1996). MSC: 68Q42 PDF BibTeX XML Cite \textit{W. Kurth}, RAIRO, Inform. Théor. Appl. 30, No. 5, 415--429 (1996; Zbl 0867.68064) Full Text: DOI EuDML OpenURL
Noltemeier, Hartmut Computer science. 1: Introduction to algorithms and computability. 2., durchges. Aufl. (Informatik. 1: Einführung in Algorithmen und Berechenbarkeit.) (German) Zbl 0814.68067 München: Hanser. 153 p. DM 36.00 /sc (1993). MSC: 68W10 68-01 68Q55 68N01 68Q42 68Q45 PDF BibTeX XML Cite \textit{H. Noltemeier}, Informatik. 1: Einführung in Algorithmen und Berechenbarkeit. 2., durchges. Aufl. München: Hanser (1993; Zbl 0814.68067) OpenURL
Zhang, Louxin Some properties of finite special string-rewriting systems. (English) Zbl 0768.68073 J. Symb. Comput. 14, No. 4, 359-369 (1992). MSC: 68Q42 PDF BibTeX XML Cite \textit{L. Zhang}, J. Symb. Comput. 14, No. 4, 359--369 (1992; Zbl 0768.68073) Full Text: DOI OpenURL
Kobayashi, Yuji Partial commutation, homology, and the Möbius inversion formula. (English) Zbl 0900.20156 Ito, Masami (ed.), Words, languages and combinatorics, Kyoto, Japan, August 28–31, 1990. Singapore: World Scientific. 288-298 (1992). MSC: 20M50 05A10 20M05 20M35 68Q42 PDF BibTeX XML Cite \textit{Y. Kobayashi}, in: Words, languages and combinatorics, Kyoto, Japan, August 28--31, 1990. Singapore: World Scientific. 288--298 (1992; Zbl 0900.20156) OpenURL
Diekert, Volker Some mathematical aspects of trace theory. (English) Zbl 0900.20114 Mitt. Math. Ges. Hamb. 12, No. 4, 1171-1181 (1991). MSC: 20M05 20M35 68R15 20E22 20E05 PDF BibTeX XML Cite \textit{V. Diekert}, Mitt. Math. Ges. Hamb. 12, No. 4, 1171--1181 (1991; Zbl 0900.20114) OpenURL
Kurth, Winfried Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. (Termination and confluence of semi-Thue-systems with a single rule). (German) Zbl 0719.03019 Clausthal: Techn. Univ. Clausthal, Math.-Naturwiss. Fak., Diss. vii, 189 S. (1990). Reviewer: M.Zimand (Bucureşti) MSC: 03D03 68Q42 20M05 PDF BibTeX XML Cite \textit{W. Kurth}, Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. (Termination and confluence of semi-Thue-systems with a single rule). Clausthal: Techn. Univ. Clausthal, Math.-Naturwiss. Fak. (1990; Zbl 0719.03019) OpenURL
Diekert, Volker Combinatorics on traces. (English) Zbl 0717.68002 Lecture Notes in Computer Science, 454. Berlin etc.: Springer-Verlag. VII, 164 p. DM 33.00 (1990). Reviewer: G.Mauri MSC: 68-02 68Q45 68R15 68Q05 68Q10 03D03 68Q42 68Q85 PDF BibTeX XML Cite \textit{V. Diekert}, Combinatorics on traces. Berlin etc.: Springer-Verlag (1990; Zbl 0717.68002) Full Text: DOI OpenURL
Kudlek, Manfred Comparison of basic language generating devices (non-deterministic systems). (English) Zbl 0704.68063 RAIRO, Inform. Théor. Appl. 24, No. 5, 489-508 (1990). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{M. Kudlek}, RAIRO, Inform. Théor. Appl. 24, No. 5, 489--508 (1990; Zbl 0704.68063) Full Text: DOI EuDML OpenURL
Kudlek, M. Dead word languages and adult languages. (English) Zbl 0736.68053 PU.M.A., Pure Math. Appl., Ser. A 1, No. 3-4, 343-355 (1990). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{M. Kudlek}, PU.M.A., Pure Math. Appl., Ser. A 1, No. 3--4, 343--355 (1990; Zbl 0736.68053) OpenURL
Cămpeanu, Cezar Post’s correspondence problem. A new proof. (English) Zbl 0681.03024 Stud. Cercet. Mat. 41, No. 4, 225-235 (1989). Reviewer: A.Kreczmar MSC: 03D40 03D35 03D03 PDF BibTeX XML Cite \textit{C. Cămpeanu}, Stud. Cercet. Mat. 41, No. 4, 225--235 (1989; Zbl 0681.03024) OpenURL
Lambek, J. Grammar as mathematics. (English) Zbl 0645.68081 Can. Math. Bull. 32, No. 3, 257-273 (1989). MSC: 68Q45 68T50 PDF BibTeX XML Cite \textit{J. Lambek}, Can. Math. Bull. 32, No. 3, 257--273 (1989; Zbl 0645.68081) Full Text: DOI OpenURL
Diekert, Volker Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids. (English) Zbl 0707.68049 Automata, languages and programming, Proc. 15th Int. Colloq., Tampere/Finn. 1988, Lect. Notes Comput. Sci. 317, 176-187 (1988). MSC: 68Q42 03D03 68Q45 PDF BibTeX XML OpenURL
Diekert, Volker Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids. (English) Zbl 0986.68513 Sémin. Lothar. Comb. 19, B19c, no pag. (1988). MSC: 68Q42 03D03 68Q45 PDF BibTeX XML Cite \textit{V. Diekert}, Sémin. Lothar. Comb. 19, B19c, no pag. (1988; Zbl 0986.68513) Full Text: EMIS OpenURL
Klop, Jan Willem Term rewriting systems: A tutorial. (English) Zbl 0666.68025 Bull. EATCS 32, 143-182 (1987). Reviewer: S.P.Yukna MSC: 68Q65 68P05 03B35 PDF BibTeX XML Cite \textit{J. W. Klop}, Bull. EATCS 32, 143--182 (1987; Zbl 0666.68025) OpenURL
Kurth, Winfried Some combinatorial properties of complete semi-Thue systems. (English) Zbl 0977.68547 Sémin. Lothar. Comb. 18, B18m, 2 p. (1987). MSC: 68Q42 PDF BibTeX XML Cite \textit{W. Kurth}, Sémin. Lothar. Comb. 18, B18m, 2 p. (1987; Zbl 0977.68547) Full Text: EuDML EMIS OpenURL
Otto, Friedrich The undecidability of self-embedding for finite semi-Thue and Thue systems. (English) Zbl 0624.03032 Theor. Comput. Sci. 47, 225-232 (1986). MSC: 03D03 03D35 03D40 PDF BibTeX XML Cite \textit{F. Otto}, Theor. Comput. Sci. 47, 225--232 (1986; Zbl 0624.03032) Full Text: DOI OpenURL
Kudlek, M. Languages defind by semi-Thue and regular systems. (English) Zbl 0623.68069 Algebra, combinatorics and logic in computer science, Colloq. Györ/Hung. 1983, Vol. 2, Colloq. Math. Soc. János Bolyai 42, 537-553 (1986). Reviewer: M.Gheorghe MSC: 68Q45 68Q42 PDF BibTeX XML OpenURL
Kudlek, M. Languages defined by deterministic semi-Thue systems. (English) Zbl 0622.68062 Topics in the theoretical bases and applications of computer science, Proc. 4th Hung. Conf., Györ/Hung. 1985, 41-52 (1986). Reviewer: V.Coardoş MSC: 68Q45 PDF BibTeX XML OpenURL
Diekert, Volker Complete semi-Thue systems for abelian groups. (English) Zbl 0609.68028 Theor. Comput. Sci. 44, 199-208 (1986). MSC: 68Q65 20M05 20K99 03D03 03D40 PDF BibTeX XML Cite \textit{V. Diekert}, Theor. Comput. Sci. 44, 199--208 (1986; Zbl 0609.68028) Full Text: DOI OpenURL
Kapur, Deepak; Narendran, Paliath A finite Thue system with decidable word problem and without equivalent finite canonical system. (English) Zbl 0588.03023 Theor. Comput. Sci. 35, 337-344 (1985). Reviewer: S.P.Yukna MSC: 03D03 03D40 20M05 PDF BibTeX XML Cite \textit{D. Kapur} and \textit{P. Narendran}, Theor. Comput. Sci. 35, 337--344 (1985; Zbl 0588.03023) Full Text: DOI OpenURL
Salomaa, Arto Computation and automata. (English) Zbl 0565.68046 Encyclopedia of Mathematics and Its Applications, Vol. 25. Cambridge etc.: Cambridge University Press. XIII, 282 p. £25.00; $ 39.50 (1985). Reviewer: M.Jantzen MSC: 68Q05 03Dxx 68Q25 68Q42 68Q45 94A60 03-00 03-01 68-00 68-01 PDF BibTeX XML OpenURL
Nguyen Xuan My Some generalized semi-Thue systems. (English) Zbl 0552.68063 Int. J. Comput. Math. 17, 25-36 (1985). MSC: 68Q45 PDF BibTeX XML Cite \textit{Nguyen Xuan My}, Int. J. Comput. Math. 17, 25--36 (1985; Zbl 0552.68063) Full Text: DOI OpenURL
Jantzen, Matthias Thue systems and the Church-Rosser property. (English) Zbl 0553.03025 Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 80-95 (1984). MSC: 03D03 68Q65 03C05 PDF BibTeX XML OpenURL
Penttonen, Martti The reachability of vector addition systems and equivalent problems. (English) Zbl 0551.68048 Ann. Univ. Turku., Ser. A I 186, 80-86 (1984). Reviewer: J.Bergandy MSC: 03D60 03D40 68Q85 68Q45 20M05 PDF BibTeX XML Cite \textit{M. Penttonen}, Ann. Univ. Turku, Ser. A I 186, 80--86 (1984; Zbl 0551.68048) OpenURL
Jantzen, Matthias; Kudlek, Manfred Homomorphic images of sentential form languages defined by semi-Thue systems. (English) Zbl 0542.68059 Theor. Comput. Sci. 33, 13-43 (1984). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Jantzen} and \textit{M. Kudlek}, Theor. Comput. Sci. 33, 13--43 (1984; Zbl 0542.68059) Full Text: DOI OpenURL
Jantzen, Matthias; Kudlek, Manfred Homomorphic images of sentential form languages defined by semi Thue systems. (English) Zbl 0542.68060 Foundations of software technology and theoretical computer science, 2nd Conf., Bangalore/India 1982, 126-135 (1982). MSC: 68Q45 PDF BibTeX XML OpenURL
Griffiths, T. V. Some remarks on derivations in general rewriting systems. (Russian) Zbl 0551.68066 Kibern. Sb., Nov. Ser. 18, 75-99 (1981). MSC: 68Q45 03D03 03D25 PDF BibTeX XML Cite \textit{T. V. Griffiths}, Kibern. Sb., Nov. Ser. 18, 75--99 (1981; Zbl 0551.68066) OpenURL
Pansiot, J. J. A note on Post’s correspondence problem. (English) Zbl 0485.03018 Inf. Process. Lett. 12, 233 (1981). MSC: 03D35 03D03 PDF BibTeX XML Cite \textit{J. J. Pansiot}, Inf. Process. Lett. 12, 233 (1981; Zbl 0485.03018) Full Text: DOI OpenURL
Noltemeier, Hartmut Informatik I: Einführung in Algorithmen und Berechenbarkeit. (German) Zbl 0477.68002 München, Wien: Carl Hanser Verlag. 148 S. DM 32.00 (1981). MSC: 68-01 68W99 68Q05 03D60 03D20 68Q55 68Q60 68N01 68Q45 PDF BibTeX XML OpenURL
Gabrielian, Armen Pure grammars and pure languages. (English) Zbl 0454.68097 Int. J. Comput. Math. 9, 3-16 (1981). MSC: 68Q45 03D03 68Q05 68Q65 PDF BibTeX XML Cite \textit{A. Gabrielian}, Int. J. Comput. Math. 9, 3--16 (1981; Zbl 0454.68097) Full Text: DOI OpenURL
Cenzer, Douglas Non-generable formal languages. (English) Zbl 0454.68087 Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 3, 95-103 (1980). MSC: 68Q45 03D03 03D20 03D70 03D25 03D30 PDF BibTeX XML Cite \textit{D. Cenzer}, Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 3, 95--103 (1980; Zbl 0454.68087) OpenURL
My, Nguyen Xuan Some classes of semi-Thue systems. (English) Zbl 0443.68064 Elektron. Inform.-verarb. Kybernetik 16, 3-10 (1980). MSC: 68Q45 03D03 PDF BibTeX XML Cite \textit{N. X. My}, Elektron. Informationsverarbeitung Kybernetik 16, 3--10 (1980; Zbl 0443.68064) OpenURL
Börger, Egon A new general approach to the theory of the many-one equivalence of decision problems for algorithmic systems. (English) Zbl 0429.03016 Z. Math. Logik Grundlagen Math. 25, 135-162 (1979). MSC: 03D03 03D05 03D10 03D30 03D40 03B25 03-02 PDF BibTeX XML Cite \textit{E. Börger}, Z. Math. Logik Grundlagen Math. 25, 135--162 (1979; Zbl 0429.03016) Full Text: DOI OpenURL
Deussen, P. One abstract accepting algorithm for all kinds of parsers. (English) Zbl 0412.68081 Automata, languages and programming, 6th Colloq., Graz 1979, Lect. Notes Comput. Sci. 71, 203-217 (1979). MSC: 68N20 68Q45 03D03 PDF BibTeX XML OpenURL
Poigne, Axel Context-free rewriting. (English) Zbl 0473.68069 Ber., Abt. Inf., Univ. Dortm. 74, 85-91 (1978). MSC: 68Q45 18D10 03D03 PDF BibTeX XML OpenURL
Shekhtman, V. B. An undecidable superintuitionistic propositional calculus. (English. Russian original) Zbl 0417.03010 Sov. Math., Dokl. 19, 656-660 (1978); translation from Dokl. Akad. Nauk SSSR 240, 549-552 (1978). MSC: 03B55 03D03 03D35 PDF BibTeX XML Cite \textit{V. B. Shekhtman}, Sov. Math., Dokl. 19, 656--660 (1978; Zbl 0417.03010); translation from Dokl. Akad. Nauk SSSR 240, 549--552 (1978) OpenURL