AN ANALITIC APPROACH IN THE THEORY OF CONTEXT-FREE LANGUAGES GREIBACH NORMAL FORM

2009 ◽  
pp. 112-116
Author(s):  
K. V. Safonov ◽  
O. I. Egorushkin
Keyword(s):  
Normal Form ◽  
Context Free ◽  
Greibach Normal Form

A Survey of Normal form Covers for Regular Grammars

1981 ◽  
Vol 4 (4) ◽  
pp. 761-776
Author(s):  
Anton Nijholt
Keyword(s):  
Normal Form ◽  
Special Form ◽  
Normal Forms ◽  
Context Free Grammar ◽  
Left Regular ◽  
Regular Grammar ◽  
Left And Right ◽  
Context Free ◽  
Greibach Normal Form

An overview is given of cover results for normal forms of regular grammars. Due to the special form of regular grammars and due to the results which are obtained it is sufficient to consider covering grammars in Greibach normal form. Among other things it is proved that any left-regular grammar can be left covered with a context-free grammar in Greibach normal form. All the cover results concerning the left- and right-regular grammars are listed, with respect to several types of covers, in a cover table.

scholarly journals GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM

2007 ◽  
Vol 18 (06) ◽  
pp. 1139-1149 ◽  
Author(s):  
PETER R. J. ASVELD
Keyword(s):  
Normal Form ◽  
Complexity Measures ◽  
Descriptional Complexity ◽  
Low Degree ◽  
Cyclic Shifts ◽  
Low Degree Polynomials ◽  
Context Free ◽  
Greibach Normal Form ◽  
Context Free Grammars

For each alphabet Σn = {a1,a2,…,an}, linearly ordered by a1 < a2 < ⋯ < an, let Cn be the language of circular or cyclic shifts over Σn, i.e., Cn = {a1a2 ⋯ an-1an, a2a3 ⋯ ana1,…,ana1 ⋯ an-2an-1}. We study a few families of context-free grammars Gn (n ≥1) in Greibach normal form such that Gn generates Cn. The members of these grammar families are investigated with respect to the following descriptional complexity measures: the number of nonterminals ν(n), the number of rules π(n) and the number of leftmost derivations δ(n) of Gn. As in the case of Chomsky normal form, these ν, π and δ are functions bounded by low-degree polynomials. However, the question whether there exists a family of grammars that is minimal w. r. t. all these measures remains open.

scholarly journals Greibach Normal Form in Algebraically Complete Semirings

2002 ◽  
Vol 9 (46) ◽  
Author(s):  
Zoltán Ésik ◽  
Hans Leiß
Keyword(s):  
Fixed Point ◽  
Normal Form ◽  
Fixed Points ◽  
Form Theorem ◽  
Point Operator ◽  
Normal Form Theorem ◽  
Context Free ◽  
Greibach Normal Form

We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages. In particular, we show that Greibach's normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chain- and deletion rules depend on their inequational properties (and the idempotency of addition). It follows that these normal form theorems also hold in non-continuous semirings having enough fixed-points.

scholarly journals On greibach normal form construction

1985 ◽  
Vol 40 ◽  
pp. 315-317 ◽  
Author(s):  
Friedrich J. Urbanek
Keyword(s):  
Normal Form ◽  
Greibach Normal Form

MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS

2011 ◽  
Vol 21 (01n02) ◽  
pp. 35-59 ◽  
Author(s):  
A. CHERUBINI ◽  
C. NUCCIO ◽  
E. RODARO
Keyword(s):  
Normal Form ◽  
Inverse Semigroups ◽  
Satisfiability Problem ◽  
Finite Set ◽  
Context Free ◽  
Schützenberger Automaton ◽  
Amalgamated Product

Let S = S1 *U S2 = Inv〈X; R〉 be the free amalgamated product of the finite inverse semigroups S1, S2 and let Ξ be a finite set of unknowns. We consider the satisfiability problem for multilinear equations over S, i.e. equations wL ≡ wR with wL, wR ∈ (X ∪ X-1 ∪ Ξ ∪ Ξ-1)+ such that each x ∈ Ξ labels at most one edge in the Schützenberger automaton of either wL or wR relative to the presentation 〈X ∪ Ξ|R〉. We prove that the satisfiability problem for such equations is decidable using a normal form of the words wL, wR and the fact that the language recognized by the Schützenberger automaton of any word in (X ∪ X-1)+) relative to the presentation 〈X|R〉 is context-free.

scholarly journals Algebraically complete semirings and Greibach normal form

2005 ◽  
Vol 133 (1-3) ◽  
pp. 173-203 ◽  
Author(s):  
Zoltán Ésik ◽  
Hans Leiß
Keyword(s):  
Normal Form ◽  
Greibach Normal Form
Sign in / Sign up

Export Citation Format

Share Document