1 October 2005 in Artificial Intelligence
1 January 2011 in International Journal of Approximate Reasoning
1 April 2013 in Decision Support Systems
31 December 1987 in Information Processing & Management
1 October 1978 in Journal of the ACM
The class of noncountlng (aperiodic) context-free parenthesis languages is introduced here and is found to extend the classical theory of noncountmg regular languages It Is proved that it is possible to decide whether or not a context-free parenthesis grammar Is noncountmg The class of k-distract-homogeneous grammars (previously introduced in connection with studies on grammatical mference or language acqmsitmn) is rigorously defined and proved to be noncountlng It as argued that the noncountmg model fits the syntactic aspects of natural or araficial languages more closely than the context-free model
1 January 2009 in Lecture Notes in Computer Science