Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

Abstract It is shown that for every language family that is a trio containing only semilinear languages, all bounded languages in it can be accepted by one-way deterministic reversal-bounded multicounter machines ( DCM ). This implies that for every semilinear trio (where these properties are effective), it is possible to decide containment, equivalence, and disjointness concerning its bounded languages. A condition is also provided for when the bounded languages in a semilinear trio coincide exactly with those accepted by DCM machines, and it is used to show that many grammar systems of finite index — such as finite-index matrix grammars ( M fin ) and finite-index ET0L ( ET0L fin ) — have identical bounded languages as DCM . Then connections between ambiguity, counting regularity, and commutative regularity are made, as many machines and grammars that are unambiguous can only generate/accept counting regular or commutatively regular languages. Thus, such a system that can generate/accept a non-counting regular or non-commutatively regular language implies the existence of inherently ambiguous languages over that system. In addition, it is shown that every language generated by an unambiguous M fin has a rational characteristic series in commutative variables, and is counting regular. This result plus the connections are used to demonstrate that the grammar systems M fin and ET0L fin can generate inherently ambiguous languages (over their grammars), as do several machine models. It is also shown that all bounded languages generated by these two grammar systems (those in any semilinear trio) can be generated unambiguously within the systems. Finally, conditions on M fin and ET0L fin languages implying commutative regularity are obtained. In particular, it is shown that every finite-index ED0L language is commutatively regular.

[1]  Grzegorz Rozenberg,et al.  On ET0L Systems of Finite Index , 1978, Inf. Control..

[2]  Maurice Gross.  Inherent Ambiguity of Minimal Linear Grammars , 1964, Inf. Control..

[3]  Benedetto Intrigila,et al.  On the commutative equivalence of semi-linear sets of Nk , 2015, Theor. Comput. Sci..

[4]  Andrzej Ehrenfeucht,et al.  On Ambiguity in E0L Systems , 1980, Theor. Comput. Sci..

[5]  Andrzej Ehrenfeucht,et al.  On Inherently Ambiguous E0L Languages , 1984, Theor. Comput. Sci..

[6]  Oscar H. Ibarra,et al.  The effect of end-markers on counter machines and commutativity , 2016, Theor. Comput. Sci..

[7]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[8]  Joffroy Beauquier.  Deux Familles de Langages Incomparables , 1979, Inf. Control..

[9]  Werner Kuich,et al.  The Characterization of Nonexpansive Grammars by Rational Power Series , 1981, Inf. Control..

[10]  Oscar H. Ibarra,et al.  On Finite-Index Indexed Grammars and Their Restrictions , 2016, LATA.

[11]  Oscar H. Ibarra,et al.  On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers , 1986, STACS.

[12]  Luca Breveglieri,et al.  Multi-Push-Down Languages and Grammars , 1996, Int. J. Found. Comput. Sci..

[13]  Gheorghe Paun.  Some further remarks on the family of finite index matrix languages , 1979, RAIRO Theor. Informatics Appl..

[14]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[15]  Rainer Parchmann,et al.  Linear Indexed Languages , 1984, Theor. Comput. Sci..

[16]  Philippe Flajolet,et al.  Analytic Models and Ambiguity of Context-free Languages* , 2022 .

[17]  Oscar H. Ibarra,et al.  On families of full trios containing counter machine languages , 2019, Theor. Comput. Sci..

[18]  Meera Blattner.  Inherent Ambiguities in Families of Grammars (Extended Abstract) , 1979, ICALP.

[19]  Armin B. Cremers,et al.  Context-Free Grammar Forms , 1974, J. Comput. Syst. Sci..

[20]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[21]  Gheorghe Paun.  On the Family of Finite Index Matrix Languages , 1979, J. Comput. Syst. Sci..

[22]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[23]  Benedetto Intrigila,et al.  On the commutative equivalence of bounded context-free and regular languages: The semi-linear case , 2015, Theor. Comput. Sci..

[24]  Tero Harju,et al.  Some Decision Problems Concerning Semilinearity and Commutation , 2002, J. Comput. Syst. Sci..

[25]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[26]  Antonio Restivo,et al.  Codes and Automata , 1987, Formal Properties of Finite Automata and Applications.

[27]  Flavio D'Alessandro,et al.  On the Commutative Equivalence of Context-Free Languages , 2018, DLT.

[28]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[29]  Oscar H. Ibarra,et al.  On counting functions and slenderness of languages , 2019, Theor. Comput. Sci..

[30]  Sheila A. Greibach,et al.  Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[31]  Benedetto Intrigila,et al.  On the commutative equivalence of bounded context-free and regular languages: The code case , 2015, Theor. Comput. Sci..

[32]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[33]  Dominique Perrin,et al.  On the generating sequences of regular languages on k symbols , 2003, JACM.

[34]  Oscar H. Ibarra,et al.  Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines , 2012, Int. J. Found. Comput. Sci..

[35]  Brigitte Rozoy.  The Dyck Language D'_1^* Is Not Generated by Any Matric Grammar of Finite Index , 1987, Inf. Comput..

[36]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[37]  Benedetto Intrigila,et al.  On the structure of the counting function of sparse context-free languages , 2006, Theor. Comput. Sci..

[38]  Grzegorz Rozenberg,et al.  On the Effect of the Finite Index Restriction on Several Families of Grammars , 1978, Inf. Control..