Learning a subclass of linear languages from positive structural information

Sempere, José M.; Nagaraja, G S

doi:10.1007/bfb0054073

Cited by 11 publications

(8 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even linear languages are generated by grammars where the rules are balanced: the right hands are composed either of terminal symbols only, or are of the form uT v where only T is non-terminal and u and v have identical length. Following this trend, other results concerning this class of languages (or similar) are an extension to a hierarchy of linear languages [83], the case where only positive strings are available [84] (but then only a sub-class is identifiable), and the case where the positive information is structural (if you know where the center of the strings is) [85]. Different surveys on the subject have been written by Yokomori [86], Lee [14] or Sakakibara [15].…”

Section: The Case Of Context-free Languagesmentioning

confidence: 96%

A bibliographical study of grammatical inference

Higuera

2005

Pattern Recognition

174

View full text Add to dashboard Cite

Section: The Case Of Context-free Languagesmentioning

confidence: 96%

A bibliographical study of grammatical inference

Higuera

2005

Pattern Recognition

174

View full text Add to dashboard Cite

“…Sempere and Nagaraja [12] have considered the inferability of a subclass of linear languages from positive structural samples. In addition to an input string, the corresponding parsing tree without labels of internal nodes is given.…”

Section: Theorem 33 Almost Terminal-fixed Even Linear Languages Can mentioning

confidence: 99%

“…A sample pair , is now given in the form , where each in and each in , corresponding a sequence of moves , , , . Since we deal with linear grammars, this is the same information as used in the structural grammatical inference problem [11,12].…”

Section: Theorem 41 Regular Translations Realized By Lengthpreservinmentioning

confidence: 99%

Inferring finite transducers

Mäkinen¹

2003

J. Braz. Comp. Soc.

View full text Add to dashboard Cite

We consider the inference problem for finite transducers using different kinds of samples (positive and negative samples, positive samples only, and structural samples). Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs. We show that this problem can be solved in certain special cases by using known results on the inference problem for linear languages.

show abstract

“…In addition, "structural information" is sometimes provided to the learning algorithm (see [40] in the case of TDRL). It is argued that in applications, certain structural information is always known.…”

Section: Terminal Distinguishable Right-linear Languagesmentioning

confidence: 99%

Parallel communicating grammar systems with terminal transmission

Fernau

2001

Acta Informatica

View full text Add to dashboard Cite

We introduce a new variant of PC grammar systems, called PC grammar systems with terminal transmission, PCGSTT for short. We show that right-linear centralized PCGSTT have nice formal language theoretic properties: they are closed under gsm mappings (in particular, under intersection with regular sets and under homomorphisms) and union; a slight variant is, in addition, closed under concatenation and star; their power lies between that of n-parallel grammars introduced by Wood and that of matrix languages of index n, and their relation to equal matrix grammars of degree n is discussed. We show that membership for these language classes is complete for NL. In a second part of the paper, we discuss questions concerning grammatical inference of these systems. More precisely, we show that PCGSTT whose component grammars are terminal distinguishable right-linear, a notion introduced by Radhakrishnan and Nagaraja in [33,34], are identifiable in the limit if certain data communication information is supplied in addition.

show abstract

Learning a subclass of linear languages from positive structural information

Cited by 11 publications

References 17 publications

A bibliographical study of grammatical inference

A bibliographical study of grammatical inference

Inferring finite transducers

Parallel communicating grammar systems with terminal transmission

Contact Info

Product

Resources

About