Paper Info
Title
On the unambiguity of n-tuple languages
Abstract
Several results concerning the preservation of unambiguity in n-tuple languages are presented here. Furthermore, the notion of n-stratified sets — as appropriate generalization of the straified sets defined by Ginsburg — is introduced and a necessary and sufficient characterisation result for bounded unambiguous n-tuple languages analogous to bounded unambiguous context free languages is given.
Year
DOI
Venue
1975
10.1007/BF02252838
Computing
Keywords
DocType
Volume
Computational Mathematic, Characterisation Result, Context Free Language, Free Language, Sufficient Characterisation
Journal
15
Issue
ISSN
Citations 
1
1436-5057
0
PageRank 
References 
Authors
0.34
2
1
Name
Order
Citations
PageRank
N. Hojka100.34