Results 31 to 40 of about 63,385 (219)
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Robustness in Timed Automata [PDF]
, 2013 In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.
Markey, Nicolas +7 more
core +1 more source
Single Valued Neutrosophic General Machine [PDF]
Neutrosophic Sets and Systems, 2022 In this paper, first of all, considering the notions of single-valued neutrosophic and general fuzzy automata we present the concept of single-valued neutrosophic general machine, to simplicity, SVNGM.
Marzieh Shamsizadeh
doaj +1 more source
Model checking linear coalgebraic temporal logics: an automata-theoretic approach [PDF]
, 2011 We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras.
Cirstea, Corina, Corina Cîrstea
core +1 more source
Reasoning about XML with temporal logics and automata [PDF]
, 2010 We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs Many properties of interest in the XML context are related to ...
Leonid Libkin +3 more
core +1 more source
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 1999 A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases.
Frank Neven, Thomas Schwentick
openaire +2 more sources
On discovering functions in actin filament automata [PDF]
Royal Society Open Science, 2019 We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state.
Andrew Adamatzky
doaj +1 more source
Clocks, Automata and the Mechanization of Nature (1300–1600)
Philosophies, 2022 This paper aims at tracking down, by looking at late medieval and early modern discussions over the ontological status of artifacts, the main steps of the process through which nature became theorized on a mechanistic model in the early 17th century. The
Sylvain Roudaut
doaj +1 more source
Performance analysis of probabilistic timed automata using digital clocks [PDF]
, 2006 Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic aspects of real-time systems, and is amenable to
Kwiatkowska, M. +3 more
core +1 more source
, 2011 What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Tzevelekos, N, Nikos Tzevelekos
core +1 more source