Results 31 to 40 of about 767,182 (284)
Implicit learning of recursive context-free grammars.
PLoS ONE, 2012 Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed
Martin Rohrmeier +2 more
doaj +1 more source
Logical and Algebraic Characterizations of Rational Transductions [PDF]
Logical Methods in Computer Science, 2019 Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic.
Emmanuel Filiot +2 more
doaj +1 more source
Multipass automata and group word problems
, 2014 We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean closure of the
Ceccherini-Silberstein, Tullio +4 more
core +3 more sources
Partial Word Order Syntax of Urdu/Sindhi and Linear Specification Language
JISR Management and Social Sciences & Economics, 2007 Like most of the South-Asian languages Urdu and Sindhi are partial word order languages. Conventional syntax representation models like Context Free Grammars are not capable enough to cope with partial word order syntax.
Mutee-u- Rahman +2 more
doaj +1 more source
Monoid automata for displacement context-free languages
, 2014 In 2007 Kambites presented an algebraic interpretation of Chomsky-Schutzenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the class of displacement context-free languages which are equivalent to well ...
A. Sorokin +9 more
core +1 more source
Quantum finite automata and linear context-free languages: a decidable problem [PDF]
, 2013 We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is recursively decidable whether or not ...
A. Paz +6 more
core +1 more source
On Languages Accepted by P/T Systems Composed of joins [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology.
Pierluigi Frisco, Oscar H. Ibarra
doaj +1 more source
One-Tape Turing Machine Variants and Language Recognition
, 2015 We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d ...
Pighizzini, Giovanni
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An international Delphi panel of experts developed consensus statements to delineate the circumstances where the risks of dexamethasone as an antiemetic do and do not outweigh its benefits. Procedure Experts in supportive care of pediatric patients were invited to participate.
Negar Shavandi +20 more
wiley +1 more source
Generative Power and Closure Properties of Watson-Crick Grammars
Applied Computational Intelligence and Soft Computing, 2016 We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties.
Nurul Liyana Mohamad Zulkufli +3 more
doaj +1 more source