Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,830,515 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Chomsky hierarchy
Complexity class
Context-free grammar
Empty string
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On fuzzy multiset regular grammars
B. K. Sharma
,
Apostolos Syropoulos
,
S. P. Tiwari
2016
Corpus ID: 8377413
The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata…
Expand
2016
2016
Coalition formation in a virtual buying cooperative: a case for formal grammars
Mpho Raborife
2016
Corpus ID: 157195175
A thesis submitted in ful lment of the requirements for the degree of Computer Science in the School of Computer Science and…
Expand
2011
2011
Regular grammar transformation inspired by the graph distance using GA
V. Fábera
,
J. Zelenka
,
V. Jánes
,
Mária Jánesová
2011
Corpus ID: 54507339
This paper introduces a method how to transform one regular grammar to the second one. The transformation is based on regular…
Expand
2006
2006
Regular grammars of L(MT): a language for ecological systems modelling (I) - part I
J. Usó-Doménech
,
Francisco Vives-Macià
,
J. Mateu
Kybernetes
2006
Corpus ID: 31928761
Purpose – The purpose of this paper is to present a further extension of the regular grammars of the language L(MT).Design…
Expand
2003
2003
Language Emulator, uma ferramenta de auxlio no ensino de Teoria da Computao
Luiz Filipe
,
M. Vieira
,
Marcos Augusto
,
N. Vieira
,
Resumo
2003
Corpus ID: 59652521
A receive circuit for binary signals in time compression multiplexing systems mitigates effects of the local data decay tail and…
Expand
2002
2002
Using Context-Free Grammars to Constrain Apriori-based Algorithms for Mining Temporal Association Rules
C. Antunes
,
Arlindo L. Oliveira
2002
Corpus ID: 18493533
Algorithms for the inference of association with sequential information have been proposed and used but are ineffective, in some…
Expand
2002
2002
Inference of Sequential Association Rules Guided by Context-Free Grammars
C. Antunes
,
Arlindo L. Oliveira
International Conference on Graphics and…
2002
Corpus ID: 834258
One of the main unresolved problems in data mining is related with the treatment of data that is inherently sequential…
Expand
2000
2000
Language modeling by stochastic dependency grammar for Japanese speech recognition
Akinori Ito
,
Chiori Hori
,
M. Katoh
,
M. Kohda
Systems and Computers in Japan
2000
Corpus ID: 9765186
This paper describes a language modeling technique using a kind of stochastic context free grammar (stochastic dependency grammar…
Expand
1994
1994
Inductive Inference of Regular Grammars Using Recurrent Networks: A Critical Analysis
M. Gori
,
P. Frasconi
,
Marco Maggini
,
G. Soda
ICLP Workshop: Logic and Reasoning with Neural…
1994
Corpus ID: 10989429
Many researchers have recently explored the use of recurrent networks for the inductive inference of regular grammars from…
Expand
1972
1972
Restricted Parallelism and Regular Grammars
Robert D. Rosenbrugh
1972
Corpus ID: 63788463
Title: Restricted Parallelism and Regular Grammars, Author: Robert D. Rosebrugh, Location: Thode