Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Pushdown Automata"”.

  1. Weighted Logics and Weighted Simple Automata for Context-Free Languages of Infinite Words

    … between monadic second-order logic and finite automata for both finite and infinite words. This BET- Theorem has been extended by Lautemann, Schwentick and Thérien to context-free languages by introducing a monadic second-order logic with an additional existentially quantified second-order …

    qucosa-diss

  2. On the computational power of RNNs

    … computationally powerful as deterministic nice automata. Allowing arbitrary precision, we prove that RNNs with one hidden layer and ReLU activation are at least as computationally powerful as pushdown automata. If we also allow infinite precision, infinite edge weights, and nonlinear output …

    mit Repository record for On the computational power of RNNs (opens in a new tab)

  3. Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory

    … classical computational models, including finite automata, pushdown automata, and Turing machines. Motivated by the trade-off between expressive power and structural simplicity, it introduces a novel model called Counter-Based Finite Automata (CBFA). The proposed model extends deterministic finite …

    debrecen Repository record for Exploring Computational Models: Analysis, Extensions, and Novel Approaches in Automata Theory (opens in a new tab)

  4. QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES

    Within the realm of automata theory, various models differ on their processing mechanisms and computational paradigms. This study investigates two computational paradigms, recently introduced in the literature: quantum and translucency. Specifically, we investigate Quantum Finite State Automata

    milano Repository record for QUANTUM AND TRANSLUCENT PARADIGMS IN AUTOMATA THEORY: A STUDY ON COMPUTATIONAL CAPABILITIES (opens in a new tab)

  5. Transformation of leftmost derivations in cooperating distributed grammar systems

    … is the transformation from the ss-mode into pushdown automata analyzed for use in transforming into other modes of leftmostness. A possible improvement for transforming from the ss-mode into the ws-mode that requires less additional rules is introduced. This transformation is further expanded …

    potsdam-thes Repository record for Transformation of leftmost derivations in cooperating distributed grammar systems (opens in a new tab)