Une double hiérarchie infinie de langages vérifiables

Rodriguez, F.

doi:10.1051/ita/197509r100051

Cited by 6 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Finally we show that open bracket of order n is syntactic of degree 0. The family of checking automata languages [13,20] is closed under open bracket of order n, the regular languages and the context free languages are not closed under these operators. The families of equal matrix languages of order n [23] are easily characterized with open bracket of order n, hence we can conclude that the equal matrix languages are linear erasable.…”

Section: Open Bracket Of Order Nmentioning

confidence: 99%

“…These operators allow to build hierarchies of families of languages caused by repeated applications of these operators [2,3,10,11,12,15,19,20,22]. In some cases it was observed that one application (bracket [2], nested iterated substitution [14]) or a finite number of applications [3] of the operator produce the relevant closure of a family.…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

Compelled operations and operations of degreeP

Rodriguez

1979

Math. Systems Theory

View full text Add to dashboard Cite

Abstract. We define n-ary (n > 1) operations compelled by an operator and operations of degree p, generalizations of Greibach's binary syntactic operations. We show that properties of binary syntactic operators remain right for n-ary operations (n ~ 1) and further for idempotent operations. We obtain so hierarchy theorems among full semiAFLs and new properties about classical operations and classical families of languages. The new definitions and properties are illustrated by study of a family of n-ary operations.

show abstract