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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata…

2011

This paper introduces a method how to transform one regular grammar to the second one. The transformation is based on regular…

2006

Purpose – The purpose of this paper is to present a further extension of the regular grammars of the language L(MT).Design…

2005

Steganography, or information hiding, is to conceal the existence of messages so as to protect their conﬁdentiality. We consider…

2004

The paper outlines a hybrid architecture for a partial parser based on regular grammars over XML documents. The parser is used to…

2003

A receive circuit for binary signals in time compression multiplexing systems mitigates effects of the local data decay tail and…

2002

Algorithms for the inference of association with sequential information have been proposed and used but are ineffective, in some…

2000

This paper describes a language modeling technique using a kind of stochastic context free grammar (stochastic dependency grammar…

1981

Ab.stract: We consider parametrized data types <P: Alg(.!') __.. Alg(LI) where <P is a partial functor from the class of all…

1972

Title: Restricted Parallelism and Regular Grammars, Author: Robert D. Rosebrugh, Location: Thode