scientific article
From MaRDI portal
Publication:3996082
zbMath0798.68105MaRDI QIDQ3996082
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesalgorithmic undecidabilitylinearly bounded automatarecognition of automatastack memory
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Methods of constructing universal tests for finite-state automata ⋮ On reconstruction of information on an input word in a Medvedev permutation automaton given initial and final states