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
The Inclusion Problem for Some Subclasses of Context-Free Languages [PDF]
, 1997 By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the inclusion problem for unambiguous context-free grammars is undecidable.
Asveld, Peter R.J., Nijholt, Anton
core +1 more source
Latent-Variable PCFGs: Background and Applications [PDF]
, 2017 Latent-variable probabilistic context-free grammars are latent-variable models that are based on context-free grammars. Nonterminals are associated with latent states that provide contextual information during the top-down rewriting process of the ...
Cohen, Shay
core +2 more sources
Applying Length-Dependent Stochastic Context-Free Grammars to RNA Secondary Structure Prediction
Algorithms, 2011 In order to be able to capture effects from co-transcriptional folding, we extend stochastic context-free grammars such that the probability of applying a rule can depend on the length of the subword that is eventually generated from the symbols ...
Frank Weinberg, Markus E. Nebel
doaj +1 more source
Some combinatorial arrays related to the Lotka-Volterra system [PDF]
, 2014 The purpose of this paper is to investigate the connection between the Lotka-Volterra system and combinatorics. We study several context-free grammars associated with the Lotka-Volterra system. Some combinatorial arrays, involving the Stirling numbers of
Callan, David +2 more
core
Introducing the Concept of Activation and Blocking of Rules in the General Framework for Regulated Rewriting in Sequential Grammars [PDF]
, 2018 We introduce new possibilities to control the application of rules based on the preceding application of rules which can be de ned for a general model of sequential grammars and we show some similarities to other control mechanisms as graph-controlled
Alhazov, Artiom +2 more
core
Graph Interpolation Grammars as Context-Free Automata [PDF]
, 1998 A derivation step in a Graph Interpolation Grammar has the effect of scanning an input token. This feature, which aims at emulating the incrementality of the natural parser, restricts the formal power of GIGs.
Larcheveque, John
core +4 more sources
Using Earley Parser for Verification of Totally Ordered Hierarchical Plans
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceHierarchical planning extends classical planning by capturing the hierarchical structure of tasks via decomposition of tasks to subtasks. Hierarchical plan verification is the problem of determining whether a given plan is valid according to that ...
Kristýna Pantůčková +2 more
doaj +1 more source
TRX: A Formally Verified Parser Interpreter [PDF]
Logical Methods in Computer Science, 2011 Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser interpreter formally developed in the proof assistant Coq, capable of producing
Adam Koprowski, Henri Binsztok
doaj +1 more source
Polynomial equality testing for terms with shared substructures [PDF]
, 2005 Sharing of substructures like subterms and subcontexts in terms is a common method for space-efficient representation of terms, which allows for example to represent exponentially large terms in polynomial space, or to represent terms with iterated ...
Schmidt-Schauß, Manfred
core +1 more source