Results 21 to 30 of about 6,397 (149)
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Hendrik Jan Hoogeboom +2 more
core +5 more sources
Three Problems for Decision Rule Systems from Closed Classes
AxiomsThe study of the relationships between DRSs (Decision Rule Systems) and DTs (Decision Trees) is of considerable interest in computer science. In this paper, we consider classes of DRSs that are closed under specific operations.
Kerven Durdymyradov, Mikhail Moshkov
doaj +1 more source
How unprovable is Rabin's decidability theorem?
, 2015 We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A. +6 more
core +1 more source
, 2023 In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finite number of attributes and a mapping associating a ...
Durdymyradov, Kerven, Moshkov, Mikhail
openaire +2 more sources
Digraph Complexity Measures and Applications in Formal Language Theory [PDF]
, 2011 We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages.
Hermann Gruber +1 more
core +4 more sources
Completeness Results for Parameterized Space Classes
, 2013 The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy.
C.M.R. Kintala +10 more
core +1 more source
Lazy Probabilistic Model Checking without Determinisation [PDF]
, 2015 The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic B\"uchi automata is the inclusion of a determinisation step of the automaton under ...
Hahn, Ernst Moritz +4 more
core +2 more sources
Narrating Entanglement Without Dehumanisation in Contemporary Eco‐Fiction
Future Humanities, Volume 4, Issue 1, May 2026.ABSTRACT This essay presents a comparative analysis of two contemporary works of eco‐fiction, Richard Powers's The Overstory (2018) and Eleanor Catton's Birnam Wood (2023). Both novels use multiperspective narration in the service of entanglement narratives, forms of storytelling that emphasise the interconnection of human and nonhuman life.
Diana Rose Newby
wiley +1 more source
IMPLEMENTASI METODE RANDOM FOREST DALAM MEMPREDIKSI SINYAL PERGERAKAN SAHAM
E-Jurnal MatematikaTrading involves purchasing stocks at low prices and then selling them at high prices to generate profits in a short period. Although it offers significant gains, trading is considered a high-risk activity.
MOCH. ANJAS APRIHARTHA +2 more
doaj +1 more source
Minimizing finite automata is computationally hard [PDF]
, 2002 It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core