Regular grammar

Known as: Left regular grammar, Right regular grammar 
In theoretical computer science and formal language theory, a regular grammar is a formal grammar that is right-regular or left-regular. Every… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper introduces a method how to transform one regular grammar to the second one. The transformation is based on regular… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2005
2005
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF, which is the… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
2004
2004
The paper outlines a hybrid architecture for a partial parser based on regular grammars over XML documents. The parser is used to… (More)
Is this relevant?
2002
2002
The basic mechanism of CLaRK for linguistic processing of text corpora is the cascade regular grammar processor. The main… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
As the importance of automatically extracting and analyzing various natural language assertions about protein-protein… (More)
  • table 1
  • table 2
Is this relevant?
2000
2000
We study the problem of tiling a rectangular p× n-strip (p∈N xed, n∈N) with pieces, i.e., sets of simply connected cells. Some… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
| Extending database-like techniques to semi-structured and Web data sources is becoming a prominent research eld. These data… (More)
Is this relevant?
1997
1997
We present an e cient incremental algorithm for learning regular grammars from labeled examples and membership queries. This… (More)
Is this relevant?
1989
1989
In this paper we develop a Bayes criterion which includes the Rissanen complexity, for inferring regular grammar models. We… (More)
  • figure 1
Is this relevant?