Unrestricted grammar

In formal language theory, an unrestricted grammar is a formal grammar on which no restrictions are made on the left and right sides of the grammar's… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We present a hexahedral finite element method for simulating cuts in deformable bodies using the corotational formulation of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In order to enforce particles to search inside the solution space of interest during the optimization procedure, various boundary… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2003
2003
We study a bilateral multi-issue bargaining procedure with complete information and endogenous unrestricted agenda, in which… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Exotic macrophytes, invertebrates and fish are found in most coastal habitats in the Mediterranean Sea. The Mediterranean Sea has… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present two real-time hidden Markov model-based systems for recognizing sentence-level continuous American Sign Language (ASL… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 2
  • table 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper, we empirically evaluate algorithms for learning four Bayesian network (BN) classifiers: Naïve-Bayes, tree… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
1985
1985
Since the introduction of metamorphosis grammars (MGs) 'Colmerauer. 1978). with their associated type 0-like grammar rules, there… (More)
Is this relevant?