Monien, Burkhard; Sudborough, Ivan Hal Bandwidth contrained NP-complete problems. (English) Zbl 0618.68043 Theor. Comput. Sci. 41, 141-167 (1985). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Monien} and \textit{I. H. Sudborough}, Theor. Comput. Sci. 41, 141--167 (1985; Zbl 0618.68043) Full Text: DOI
Meyer auf der Heide, Friedhelm Simulating probabilistic by deterministic algebraic computation trees. (English) Zbl 0616.68051 Theor. Comput. Sci. 41, 325-330 (1985). MSC: 68Q05 68Q25 PDFBibTeX XMLCite \textit{F. Meyer auf der Heide}, Theor. Comput. Sci. 41, 325--330 (1985; Zbl 0616.68051) Full Text: DOI Link
Pelz, Elisabeth On the complexity of theories of permutations. (English) Zbl 0613.03002 Theor. Comput. Sci. 41, 247-269 (1985). MSC: 03B25 03D15 PDFBibTeX XMLCite \textit{E. Pelz}, Theor. Comput. Sci. 41, 247--269 (1985; Zbl 0613.03002) Full Text: DOI
Bunder, M. W. Possible forms of evaluation or reduction in Martin-Löf type theory. (English) Zbl 0612.03007 Theor. Comput. Sci. 41, 113-120 (1985). MSC: 03B15 03B70 PDFBibTeX XMLCite \textit{M. W. Bunder}, Theor. Comput. Sci. 41, 113--120 (1985; Zbl 0612.03007) Full Text: DOI
Dahlhaus, E.; Gaifman, H. Concerning two-adjacent context-free languages. (English) Zbl 0608.68061 Theor. Comput. Sci. 41, 169-184 (1985). Reviewer: R.Andonie MSC: 68Q45 PDFBibTeX XMLCite \textit{E. Dahlhaus} and \textit{H. Gaifman}, Theor. Comput. Sci. 41, 169--184 (1985; Zbl 0608.68061) Full Text: DOI
Karhumäki, Juhani A property of three-element codes. (English) Zbl 0604.68082 Theor. Comput. Sci. 41, 215-222 (1985). MSC: 68Q45 94A45 PDFBibTeX XMLCite \textit{J. Karhumäki}, Theor. Comput. Sci. 41, 215--222 (1985; Zbl 0604.68082) Full Text: DOI
Reisig, Wolfgang Petri nets with individual tokens. (English) Zbl 0604.68068 Theor. Comput. Sci. 41, 185-213 (1985). MSC: 68Q85 PDFBibTeX XMLCite \textit{W. Reisig}, Theor. Comput. Sci. 41, 185--213 (1985; Zbl 0604.68068) Full Text: DOI
Inoue, Katsushi; Takanami, Itsuo; Vollmar, Roland Alternating on-line Turing machines with only universal states and small space bounds. (English) Zbl 0604.68056 Theor. Comput. Sci. 41, 331-339 (1985). MSC: 68Q05 68Q45 PDFBibTeX XMLCite \textit{K. Inoue} et al., Theor. Comput. Sci. 41, 331--339 (1985; Zbl 0604.68056) Full Text: DOI
Căzănescu, Virgil Emil On context-free trees. (English) Zbl 0603.68084 Theor. Comput. Sci. 41, 33-50 (1985). MSC: 68Q55 68Q60 PDFBibTeX XMLCite \textit{V. E. Căzănescu}, Theor. Comput. Sci. 41, 33--50 (1985; Zbl 0603.68084) Full Text: DOI
Albert, M. H.; Lawrence, J. A proof of Ehrenfeucht’s conjecture. (English) Zbl 0602.68066 Theor. Comput. Sci. 41, 121-123 (1985). MSC: 68Q45 20M05 20M35 PDFBibTeX XMLCite \textit{M. H. Albert} and \textit{J. Lawrence}, Theor. Comput. Sci. 41, 121--123 (1985; Zbl 0602.68066) Full Text: DOI
Helfrich, Bettina Algorithms to construct Minkowski reduced and Hermite reduced lattice bases. (English) Zbl 0601.68034 Theor. Comput. Sci. 41, 125-139 (1985). Reviewer: A.Bachem MSC: 68Q25 11H06 11H55 PDFBibTeX XMLCite \textit{B. Helfrich}, Theor. Comput. Sci. 41, 125--139 (1985; Zbl 0601.68034) Full Text: DOI
Stoss, H.-J. The complexity of evaluating interpolation polynomials. (English) Zbl 0601.65006 Theor. Comput. Sci. 41, 319-323 (1985). Reviewer: Shiro Ogawa MSC: 65D05 41A05 68Q25 PDFBibTeX XMLCite \textit{H. J. Stoss}, Theor. Comput. Sci. 41, 319--323 (1985; Zbl 0601.65006) Full Text: DOI
Grant, John; Minker, Jack Inferences for numerical dependencies. (English) Zbl 0598.68066 Theor. Comput. Sci. 41, 271-287 (1985). Reviewer: E.Knuth MSC: 68P20 68T15 PDFBibTeX XMLCite \textit{J. Grant} and \textit{J. Minker}, Theor. Comput. Sci. 41, 271--287 (1985; Zbl 0598.68066) Full Text: DOI
Slutzki, Giora Alternating tree automata. (English) Zbl 0595.68050 Theor. Comput. Sci. 41, 305-318 (1985). MSC: 68Q45 68Q05 PDFBibTeX XMLCite \textit{G. Slutzki}, Theor. Comput. Sci. 41, 305--318 (1985; Zbl 0595.68050) Full Text: DOI
Barbin-Le Rest, Evelyne; Le Rest, Michel Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes). (French) Zbl 0593.20066 Theor. Comput. Sci. 41, 61-80 (1985). Reviewer: T.J.Harju MSC: 20M05 20M35 PDFBibTeX XMLCite \textit{E. Barbin-Le Rest} and \textit{M. Le Rest}, Theor. Comput. Sci. 41, 61--80 (1985; Zbl 0593.20066) Full Text: DOI
Hayashi, Susumu Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus. (English) Zbl 0592.03010 Theor. Comput. Sci. 41, 95-104 (1985). MSC: 03B40 18D15 18A40 03G30 PDFBibTeX XMLCite \textit{S. Hayashi}, Theor. Comput. Sci. 41, 95--104 (1985; Zbl 0592.03010) Full Text: DOI
Tomita, Etsuji; Seino, Kazushi A weaker sufficient condition for the equivalence of a pair of DPDA’s to be decidable. (English) Zbl 0591.68079 Theor. Comput. Sci. 41, 223-230 (1985). MSC: 68Q45 68Q05 PDFBibTeX XMLCite \textit{E. Tomita} and \textit{K. Seino}, Theor. Comput. Sci. 41, 223--230 (1985; Zbl 0591.68079) Full Text: DOI
Ibarra, Oscar H.; Palis, Michael A.; Kim, Sam M. Fast parallel language recognition by cellular automata. (English) Zbl 0591.68054 Theor. Comput. Sci. 41, 231-246 (1985). MSC: 68Q80 68Q45 PDFBibTeX XMLCite \textit{O. H. Ibarra} et al., Theor. Comput. Sci. 41, 231--246 (1985; Zbl 0591.68054) Full Text: DOI
Hirokawa, Sachio Complexity of the combinator reduction machine. (English) Zbl 0591.68048 Theor. Comput. Sci. 41, 289-303 (1985). MSC: 68Q25 68Q05 68Q60 PDFBibTeX XMLCite \textit{S. Hirokawa}, Theor. Comput. Sci. 41, 289--303 (1985; Zbl 0591.68048) Full Text: DOI
Păun, Gheorghe A variant of random context grammars: Semi-conditional grammars. (English) Zbl 0587.68071 Theor. Comput. Sci. 41, 1-17 (1985). Reviewer: J.Kelemen MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Păun}, Theor. Comput. Sci. 41, 1--17 (1985; Zbl 0587.68071) Full Text: DOI
Thibon, Jean-Yves Integrité des algèbres de séries formelles sur un alphabet partiellement commutatif. (French) Zbl 0587.68067 Theor. Comput. Sci. 41, 109-112 (1985). Reviewer: C.Reutenauer MSC: 68Q45 16W60 20M35 20M05 PDFBibTeX XMLCite \textit{J.-Y. Thibon}, Theor. Comput. Sci. 41, 109--112 (1985; Zbl 0587.68067) Full Text: DOI
Gohon, Philippe An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable. (English) Zbl 0585.68072 Theor. Comput. Sci. 41, 51-59 (1985). MSC: 68Q45 20M35 20M05 68Q70 PDFBibTeX XMLCite \textit{P. Gohon}, Theor. Comput. Sci. 41, 51--59 (1985; Zbl 0585.68072) Full Text: DOI
Maon, Yael On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages. (English) Zbl 0585.68071 Theor. Comput. Sci. 41, 105-107 (1985). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y. Maon}, Theor. Comput. Sci. 41, 105--107 (1985; Zbl 0585.68071) Full Text: DOI
Goles Ch., E. Dynamics of positive automata networks. (English) Zbl 0585.68059 Theor. Comput. Sci. 41, 19-32 (1985). MSC: 68Q80 PDFBibTeX XMLCite \textit{E. Goles Ch.}, Theor. Comput. Sci. 41, 19--32 (1985; Zbl 0585.68059) Full Text: DOI
Iliopoulos, Costas S. Computing in general Abelian groups is hard. (English) Zbl 0585.68053 Theor. Comput. Sci. 41, 81-93 (1985). MSC: 68Q25 20F05 20K01 68W30 11A41 11-04 PDFBibTeX XMLCite \textit{C. S. Iliopoulos}, Theor. Comput. Sci. 41, 81--93 (1985; Zbl 0585.68053) Full Text: DOI