Levels of representation in structuring decision problemsHYMPHREYS, P.Journal of applied systems analysis. 1984, Vol 11, pp 3-22, issn 0308-9541Article

On ambiguity in dos systemsEHRENFEUCHT, A; HAUSSLER, D; ROZENBERG, G et al.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 279-295, issn 0399-0540Article

Selecting decision support methods in organisationsVARI, A; VECSENYI, J.Journal of applied systems analysis. 1984, Vol 11, pp 23-36, issn 0308-9541Article

The complexity of monadic recursion schemes: exponential time boundsHUNT, H. B. III; ROSENKRANTZ, D. J.Journal of computer and system sciences (Print). 1984, Vol 28, Num 3, pp 395-419, issn 0022-0000Article

The complexity of monadic recursion schemes: executability problems, nesting depth, and applicationsHUNT, H. B. III; ROSENKRANTZ, D. J.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 3-38, issn 0304-3975Article

Decision problems for shuffle gammarsKOSAI, S; ARAKI, T; TOKURA, N et al.Systems, computers, controls. 1985, Vol 16, Num 1, pp 34-41, issn 0096-8765Article

Logic and machines: Decision problems and complexity proceedings/Symposium «Rekursive Kombinatorik», Münster/Westfalen, May 23-28, 1983BORGER, E; HASENJAEGER, G; RODDING, D et al.Lecture notes in computer science. 1984, Vol 71, issn 0302-9743, 456 p.Conference Proceedings

Ambiguity and decision problems concerning number systemsCULIK, K. II; SALOMAA, A.Information and control. 1983, Vol 56, Num 3, pp 139-153, issn 0019-9958Article

On the spectra of universel relational sentencesFRIEDMAN, H.Information and control. 1984, Vol 62, Num 2-3, pp 205-209, issn 0019-9958Article

Deciding nonconstructibility of 3-balls with spanning edges and interior verticesKAMEI, Satoshi.Discrete mathematics. 2007, Vol 307, Num 24, pp 3201-3206, issn 0012-365X, 6 p.Article

Uniqueness of solution in FLP under parameter perturbationsSHAFAI, B; SOTIROV, G.Fuzzy sets and systems. 1990, Vol 34, Num 2, pp 179-186, issn 0165-0114Article

ON DIRECT PRODUCTS OF AUTOMATON DECIDABLE THEORIESHODGSON BR.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 3; PP. 331-335; BIBL. 11 REF.Article

Restricted ambiguity of erasing morphismsREIDENBACH, Daniel; SCHNEIDER, Johannes C.Theoretical computer science. 2011, Vol 412, Num 29, pp 3510-3523, issn 0304-3975, 14 p.Article

Lower bounds for some decision problems over CMALAJOVICH, Gregorio.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 425-434, issn 0304-3975Article

Topological soft algebra and its applicationNAKAMURA, A.Fuzzy sets and systems. 1992, Vol 46, Num 2, pp 273-280, issn 0165-0114Article

Accepting splicing systemsMITRANA, Victor; PETRE, Ion; ROGOJIN, Vladimir et al.Theoretical computer science. 2010, Vol 411, Num 25, pp 2414-2422, issn 0304-3975, 9 p.Article

A new approach to problem definition : using information objectsKHAZANCHI, D; YADAV, S. B.Information systems management. 1995, Vol 12, Num 2, pp 21-26, issn 1058-0530Article

The decision problem for branching time logicGUREVICH, Y; SHELAH, S.The Journal of symbolic logic. 1985, Vol 50, Num 3, pp 668-681, issn 0022-4812Article

Decision problems for pushdown threadsBERGSTRA, Jan A; BETHKE, Inge; PONSE, Alban et al.Acta informatica. 2007, Vol 44, Num 2, pp 75-90, issn 0001-5903, 16 p.Article

Infinite exchange problemsSCOTT, Michael; SCOTT, Alexander.Theory and decision. 2004, Vol 57, Num 4, pp 397-406, issn 0040-5833, 10 p.Article

Terminating turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemesHUNT, H. B. III.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 2, pp 299-318, issn 0004-5411Article

THE COMPLEXITY OF PROMISE PROBLEMSSELMAN AL; YACOBI Y.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 502-509; BIBL. 4 REF.Conference Paper

A NEW GENERAL APPROACH TO THE THEORY OF THE MANY-ONE EQUIVALENCE OF DECISION PROBLEMS FOR ALGORITHMIC SYSTEMSBOERGER E.1979; Z. MATH. LOGIK GRUNDL. MATH.; DDR; DA. 1979; VOL. 25; NO 2; PP. 135-162; BIBL. 72 REF.Article

TERRAIN GUARDING IS NP-HARDKING, James; KROHN, Erik.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1316-1339, issn 0097-5397, 24 p.Article

Complexity of semi-stable and stage semantics in argumentation frameworksDVORAK, Wolfgang; WOLTRAN, Stefan.Information processing letters. 2010, Vol 110, Num 11, pp 425-430, issn 0020-0190, 6 p.Article