40,998 Hits in 4.5 sec

Page 1437 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
) ; Paun, Gheorghe (R-AOS; Bucharest) On the regularity of languages generated by context-free evolutionary grammars.  ...  The main result is that a regular set of trips, specified as a regular tree language, can be implemented by a tree-walking automaton that uses marbles and one pebble.” 2000b:68117 68Q45 Giammarresi, Dora  ... 

Splicing Systems over Permutation Groups of Length Two

N.Z.A. Hamzah, N.A. Mohd Sebry, W.H. Fong, N.H. Sarmin, S. Turaev
2014 Malaysian Journal of Fundamental and Applied Sciences  
Splicing systems with finite sets of axioms and rules generate only regular languages when no additional control is assumed.  ...  In the literature, splicing systems with additive and multiplicative valences have been investigated, and it has been shown that the family of languages generated by valence splicing systems is strictly  ...  The language produced by such a grammar is called a regular language.  ... 
doi:10.11113/mjfas.v8n2.127 fatcat:aplgmajoinhuta2jtb57y4eo5i

Page 327 of Mathematical Reviews Vol. , Issue 82a [page]

1982 Mathematical Reviews  
grammars, programmed grammars, and time- invariant grammars, which are characterized by mechanisms regu- lating the use of the productions.  ...  We prove that if L is a deterministic [a regular] language, then £ is again a deterministic [a regular] lan- guage, while most of the ‘reasonable’ subfamilies of context-free languages (linear, one-counter  ... 

Page 5986 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
Waterloo, ON) Characterizing regular languages with polynomial densities.  ...  We show that a regular language is starheight one if and only if it is the image of a regular language of polynomial density under a finite substitution.  ... 

Page 758 of Mathematical Reviews Vol. , Issue 84b [page]

1984 Mathematical Reviews  
This generalizes a homomorphic characterization of regular languages appearing in the paper by K. Culik, II et al. [Discrete Appl. Math. 4 (1982), 149-152; MR 83k:68071].  ...  The languages generated by such a grammar form are those generated by some context-free grammar each of whose production rules has the form described by some production rule of the grammar form.  ... 

Page 6650 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
This paper fo- cuses on the characterization of G-languages in terms of oo-regular languages. It is shown that the class of G-languages is a proper sub- class of the class of oo-regular languages.  ...  We first show that any linear language can be generated by a fixed linear grammar together with a regular control set.  ... 

Page 1983 of Mathematical Reviews Vol. , Issue 80E [page]

1980 Mathematical Reviews  
Author’s summary: “Characterizations of classes of languages accepted by space-bounded oracle machines are developed.  ...  These classes cannot be characterized by means of syntactic monoids because there exist languages LE@ and L’€5 US with the same syntactic monoid.  ... 

Page 2951 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
A mapping, F, from the set of all grammars into the set of all grammars is a standardizing operation on a class of recursively enumerable languages just in case F maps any grammar for any language L €  ...  System Sci. 49 (1994), no. 1, 96-107. Summary: “Notions from formal language learning theory are characterized in terms of standardizing operations on classes of recursively enumerable languages.  ... 

Page 3749 of Mathematical Reviews Vol. , Issue 81I [page]

1981 Mathematical Reviews  
of a context-free grammar G controlled by a regular subset R of the Szilard language of G.  ...  It is proved that a context-free language is generated by the depth-first derivations of an arbitrary context- free grammar controlled by an arbitrary regular set.  ... 

Page 1578 of Mathematical Reviews Vol. 55, Issue 5 [page]

1978 Mathematical Reviews  
The languages generated by | KAG are called kolam array languages (KAL). There are nine | classes of KAL depending on whether each of the two phases in | the derivations is regular, CF, or CS.  ...  Motivated by the regulated rewriting in context-free grammars, the author studies the effect of regulated rewriting on ETOL systems. 11729 68 COMPUTER SCIENCE 1578 An ETOL system G consists of an axiom  ... 

Page 2135 of Mathematical Reviews Vol. , Issue 83e [page]

1983 Mathematical Reviews  
Author’s summary: “We give intrinsic characterizations by means of analogues of regular expressions for six families of regular languages ‘related to the prefix codes, namely their reversals and their  ...  Hromkovité, Juraj 83e:68125 Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata.  ... 

Page 3420 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
From the introduction: “Classes of formal languages are frequently characterized by different types of accepting automata.  ...  Two such classes, called LL- and LR-attributed grammars, are supported by the compiler generating system MUG 1. We describe their implementation in the LR-case, which is based on work by D. A.  ... 

What can formal language theory do for animal cognition studies?

Aniello De Santo, Jonathan Rawski
2020 Royal Society Open Science  
Given any regular language, it is always possible to write a context-free grammar that characterizes said language.  ...  Focusing on more expressive characterizations instead of the minimally expressive ones (e.g. moving from regular to context-free) obfuscates these questions, by confusing what is possible with what is  ... 
doi:10.1098/rsos.191772 pmid:32257333 pmcid:PMC7062054 fatcat:uxlj5h64cbddnaylmj2d7y7kky

Page 3265 of Mathematical Reviews Vol. , Issue 81H [page]

1981 Mathematical Reviews  
The aim of the paper is to characterize for R and S when there exists a rational bijection of R onto S. One such characterization is given in terms of right-linear grammars for R and S.  ...  parenthesis grammar and the minimal one; Some applications in the theory of algebraic languages.  ... 

Page 509 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
P systems with strings as objects that are processed by rewriting rules form one of the main classes of P systems.  ...  We give some algebraic characterizations of the corresponding lan- guage classes. Similarly, we obtain an algebraic characterization of the linear languages.  ... 
« Previous Showing results 1 — 15 out of 40,998 results