Results 21 to 30 of about 439 (66)
, 2018 Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and the associated
Badillo, Liliana +3 more
core +2 more sources
A Semantic Framework for Proof Evidence [PDF]
, 2016 International audienceTheorem provers produce evidence of proof in many different formats, such as proof scripts, natural deductions, resolution refutations, Herbrand expansions, and equational rewritings.
Chihani, Zakaria +2 more
core +4 more sources
Non-redundant random generation from weighted context-free languages [PDF]
, 2008 International audienceWe address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a prede¯ned set of words. We study the limits of a rejection-based approach, whose time complexity is
Ponty, Yann
core +2 more sources
On computational complexity of Set Automata
, 2017 We consider a computational model which is known as set automata. The set automata are one-way finite automata with an additional storage---the set. There are two kinds of set automata---the deterministic and the nondeterministic ones.
Rubtsov, Alexander A. +1 more
core +1 more source
Unary Pushdown Automata and Straight-Line Programs
, 2014 We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state ...
A. Bertoni +22 more
core +1 more source
Time-Bounded Controlled Bidirectional Grammars [PDF]
, 1988 We study regularly controlled bidirectional (RCB) grammars from the viewpoint of time-bounded grammars. RCB-grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion, while the application of these rules
Hogendorp, Jan Anne
core +1 more source
Context-Free Path Querying with Structural Representation of Result
, 2017 Graph data model and graph databases are very popular in various areas such as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars.
Afroozeh Ali +4 more
core +1 more source
An Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars
, 1998 We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (PCFG), to problems in stochastic natural-language processing. Comparing the
Hwa, Rebecca
core +2 more sources
Rank, select and access in grammar-compressed strings [PDF]
, 2014 Given a string $S$ of length $N$ on a fixed alphabet of $\sigma$ symbols, a grammar compressor produces a context-free grammar $G$ of size $n$ that generates $S$ and only $S$.
Belazzougui, Djamal +2 more
core
Searching for universal model of amyloid signaling motifs using probabilistic context-free grammars. [PDF]
BMC Bioinformatics, 2021 Dyrka W +3 more
europepmc +1 more source