DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARS.

Amiram Yehudai

doi:10.1016/S0019-9958(80)90741-X

DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARS.

Amiram Yehudai^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

It is shown that the family of all linear grammars with a fixed ratio between the sizes of the terminal strings on both sides of the nonterminal in a right-hand side of production (which we call uniform linear grammars) has a decidable equivalence problem. The corresponding language family is properly contained in the linear unambiguous context-free languages and contains some nondeterministic languages.

Original language	English
Pages (from-to)	122-136
Number of pages	15
Journal	Information and control
Volume	47
Issue number	2
DOIs	https://doi.org/10.1016/S0019-9958(80)90741-X
State	Published - 1980

Access to Document

10.1016/S0019-9958(80)90741-X

Cite this

@article{358f67e61427498793f724ff63d644f5,

title = "DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARS.",

abstract = "It is shown that the family of all linear grammars with a fixed ratio between the sizes of the terminal strings on both sides of the nonterminal in a right-hand side of production (which we call uniform linear grammars) has a decidable equivalence problem. The corresponding language family is properly contained in the linear unambiguous context-free languages and contains some nondeterministic languages.",

author = "Amiram Yehudai",

year = "1980",

doi = "10.1016/S0019-9958(80)90741-X",

language = "אנגלית",

volume = "47",

pages = "122--136",

journal = "Information and control",

issn = "0019-9958",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARS.

AU - Yehudai, Amiram

PY - 1980

Y1 - 1980

N2 - It is shown that the family of all linear grammars with a fixed ratio between the sizes of the terminal strings on both sides of the nonterminal in a right-hand side of production (which we call uniform linear grammars) has a decidable equivalence problem. The corresponding language family is properly contained in the linear unambiguous context-free languages and contains some nondeterministic languages.

AB - It is shown that the family of all linear grammars with a fixed ratio between the sizes of the terminal strings on both sides of the nonterminal in a right-hand side of production (which we call uniform linear grammars) has a decidable equivalence problem. The corresponding language family is properly contained in the linear unambiguous context-free languages and contains some nondeterministic languages.

UR - http://www.scopus.com/inward/record.url?scp=0019087079&partnerID=8YFLogxK

U2 - 10.1016/S0019-9958(80)90741-X

DO - 10.1016/S0019-9958(80)90741-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0019087079

SN - 0019-9958

VL - 47

SP - 122

EP - 136

JO - Information and control

JF - Information and control

IS - 2

ER -

DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this