Results 181 to 190 of about 20,622 (217)
Some of the next articles are maybe not open access.
On the relationship between deterministic time and deterministic reversal
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Deterministic Stack Transducers
International Journal of Foundations of Computer Science, 2016We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode.
Suna Bensch +2 more
openaire +1 more source
Deterministic Neural Classification
Neural Computation, 2008This letter presents a minimum classification error learning formulation for a single-layer feedforward network (SLFN). By approximating the nonlinear counting step function using a quadratic function, the classification error rate is shown to be deterministically solvable.
openaire +3 more sources
Markers and Deterministic Acceptors for Non-Deterministic Languages
J. Autom. Lang. Comb., 2009We investigate the question as to how the intuitive structure of words in a formal language is reflected by the structure of the reduced deterministic acceptor for that language. Markers in words are known to facilitate the understanding of structure and the design ofword recognition algorithms.
openaire +1 more source
On the Parsing of Deterministic Languages
Journal of the ACM, 1974A parsing method for strict deterministic grammars is presented and a technique for using it to parse any deterministic language is indicated. An important characterization of the trees of strict deterministic grammars is established. This is used to prove iteration theorems for (strict) deterministic languages, and hence proving that ...
Michael A. Harrison, Ivan M. Havel
openaire +2 more sources
Deterministic Biautomata and Subclasses of Deterministic Linear Languages
2019We propose the notion of a deterministic biautomaton, a machine reading an input word from both ends. We focus on various subclasses of deterministic linear languages and give their characterizations by certain subclasses of deterministic biautomata. We use these characterizations to establish closure properties of the studied subclasses of languages ...
Galina Jirásková, Ondrej Klíma 0001
openaire +1 more source
On deterministic approximation of DNF
Algorithmica, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Luby, Boban Velickovic
openaire +1 more source
Nord. J. Comput., 2005
Summary: We give a deterministic version of the randomized jumplists recently introduced by \textit{H. Brönnimann}, \textit{F. Cazals} and \textit{M. Durand} [Lect. Notes Comput. Sci. 2607, 283--294 (2003; Zbl 1035.68505)]. The new structure supports searches in worst-case logarithmic time, insertions and deletions in amortized logarithmic time (versus
openaire +1 more source
Summary: We give a deterministic version of the randomized jumplists recently introduced by \textit{H. Brönnimann}, \textit{F. Cazals} and \textit{M. Durand} [Lect. Notes Comput. Sci. 2607, 283--294 (2003; Zbl 1035.68505)]. The new structure supports searches in worst-case logarithmic time, insertions and deletions in amortized logarithmic time (versus
openaire +1 more source
On Non-Deterministic Quantification
Logica Universalis, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Redundancy in Deterministic Sequences
IEEE Transactions on Systems Science and Cybernetics, 1970A method is presented for defining an information measure for deterministic sequences. This is done by considering a sequence as a non-Markovian sample space. The correspondence between redundancy, as defined by this information measure, and measured perception ability is considered.
openaire +2 more sources