Decision problems for Clark-congruential languages

A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference. We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG.

[1]  Catriel Beeri.  An improvement on valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[2]  Alexander Clark,et al.  Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher , 2010, ICGI.

[3]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1965, Inf. Control..

[4]  Géraud Sénizergues,et al.  The Equivalence and Inclusion Problems for NTS Languages , 1985, J. Comput. Syst. Sci..

[5]  Leslie G. Valiant.  The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata , 1974, Inf. Control..

[6]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[7]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[8]  Géraud Sénizergues,et al.  L(A) = L(B)? Decidability Results from Complete Formal Systems , 2002, ICALP.

[9]  Luc Boasson,et al.  The equivalence of pre-NTS grammars is decidable , 2005, Mathematical systems theory.

[10]  Luc Boasson,et al.  NTS Languages Are Deterministic and Congruential , 1985, J. Comput. Syst. Sci..

[11]  Friedrich Otto,et al.  String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[12]  Luc Boasson,et al.  Derivations et Redutions dans les Grammaires Algebriques , 1980, ICALP.

[13]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[14]  Colin Stirling,et al.  Deciding DPDA Equivalence Is Primitive Recursive , 2002, ICALP.

[15]  Géraud Sénizergues,et al.  The Equivalence Problem for t-Turn DPDA Is Co-NP , 2003, ICALP.

[16]  Ryo Yoshinaka,et al.  Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher , 2010, FG.