Abstract
The PLP conjecture for monoids states that for every monoid M, either M is universal (that is, for every language \(L \subseteq \varSigma ^*\) there is a program over M which accepts the language L) or it has the polynomial length property (that is, every program over the monoid M has an equivalent program of length \({\mathsf {poly}}(n)\)). The conjecture has been confirmed (Tesson-Therien (2001)) for the case of groups and several subclasses of aperiodic monoids such as the variety DA and the monoids divided by the monoid U. However, the case of the set of monoids divided by the monoid \(\mathsf {BA}_2\) is still open, which if resolved, confirms the conjecture for all aperiodic monoids.
In this paper, we make progress towards confirming the conjecture for the case when the monoid is \(\mathsf {BA}_2\). It is known (Tesson-Therien 2001) already that the monoid \(\mathsf {BA}_2\) is not universal.
Towards proving that the monoid \(\mathsf {BA}_2\) has polynomial length property, we show the following results: we define a program over a monoid M to be a non-nullable program if there is no input for which the yield of the program is the zero of the monoid. We prove the following:
-
If a program over \(\mathsf {BA}_2\) is non-nullable, then there is an equivalent program with length at most \({\mathsf {poly}}(n)\).
-
If a program over \(\mathsf {BA}_2\) is nullable, then it should be exponentially non-nullable - that is there should be at least \(2^{\varOmega (n)}\) many inputs which send the output of the program to 0 of \(\mathsf {BA}_2\). We show that for any program P over \(\mathsf {BA}_2\), if the zeroes of the program have a witness subprogram of polynomial length, then there is a program of length \({\mathsf {poly}}(n)\) equivalent to program P.
On the universality front, Tesson and Therien(2001) have already shown that PARITY cannot be computed by programs over \(\mathsf {BA}_2\). We strengthen this in two ways. Firstly, we show that programs over \(\mathsf {BA}_2\) cannot accept any subset of PARITY or \(\overline{\mathsf {PARITY}}\) of size \(n^{\omega (1)}\). Secondly, we generalize the model of programs to allow parity queries to the input instead of variables. We show that \(\mathsf {BA}_2\) cannot compute parity of n input bits even when parity queries are allowed of size \(k < \frac{n}{3}\). In contrast, we show that there are polynomial length programs over \(\mathsf {BA}_2\) to compute parity when queries are allowed as parity of \(\frac{n}{3}\) bits or higher.
Keywords
M. S. Kulkarni—Supported by postdoctoral fellowship from National Board of Higher Mathematics, Department of Atomic Energy (Government of India).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A monoid M is said to be divided by another monoid N if there is a homomorphism from a submonoid of M onto N.
- 2.
Languages recognized by polynomial length programs over monoids in \(\mathsf{DA}\) are contained in \({\mathsf {AC}}^0\) (with depth 3). And more generally, polynomial length programs over aperiodic monoids are known [3] to capture exactly the complexity class \({\mathsf {AC}}^0\).
- 3.
Note, however, that even if \(\mathsf {BA}_2\) is proven to be having the polynomial length property, it does not imply the conjecture for all aperiodic monoids since monoids such as \(\mathsf {BA}_2 \times \mathsf{U}\) which is divided by \(\mathsf {BA}_2\) does not have the polynomial length property.
- 4.
Such paths can also have zero length, when it is just a vertex v with input \(w \in N_v\).
References
Barrington, D., Straubing, H., Thérien, D.: Non-uniform automata over groups. Inf. Comput. 89(2), 109–132 (1990). Preliminary version appeared in ICALP 1987
Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC\(^1\). J. Comput. Syst. Sci. 38(1), 150–164 (1989)
Barrington, D.A.M., Thérien, D.: Finite monoids and the fine structure of NC\(^1\). J. ACM 35(4), 941–952 (1988)
Beaudry, M., McKenzie, P., Thérien, D.: The membership problem in aperiodic transformation monoids. J. ACM 39(3), 599–616 (1992)
Eilenberg, S.: Automata, Languages, and Machines Vol A and B. Academic press (1974)
Grosshans, N., McKenzie, P., Segoufin, L.: The power of programs over monoids in DA. In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), vol. 83, pp. 2:1–2:20 (2017)
Krohn, K., Rhodes, J.: Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Am. Math. Soc. 116, 450–464 (1965)
Maciel, A., Péladeau, P., Thérien, D.: Programs over semigroups of dot-depth one. Theor. Comput. Sci. 245(1), 135–148 (2000)
Maurer, W.D., Rhodes, J.L.: A property of finite simple non-Abelian groups. Proc. Am. Math. Soc. 16(3), 552–554 (1965)
McKenzie, P., Péladeau, P., Thérien, D.: NC\(^1\): the automata-theoretic viewpoint. Comput. Complex. 1, 330–359 (1991)
Pin, J.E., Miller, R.E.: Varieties of Formal Languages. Plenum Publishing Co. (1986)
Péladeau, P., Straubing, H., Therien, D.: Finite semigroup varieties defined by programs. Theor. Comput. Sci. 180(1), 325–339 (1997)
Tesson, P.: Computational Complexity Questions Related to Finite Monoids and Semigroups. Ph.D. thesis, McGill University (2003)
Tesson, P., Thérien, D.: The computing power of programs over finite monoids. J. Autom. Lang. Comb. 7(2), 247–258 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Kulkarni, M.S., Sarma, J., Sundaresan, J. (2021). On the Computational Power of Programs over \(\mathsf {BA}_2\) Monoid. In: Leporati, A., MartÃn-Vide, C., Shapira, D., Zandron, C. (eds) Language and Automata Theory and Applications. LATA 2021. Lecture Notes in Computer Science(), vol 12638. Springer, Cham. https://doi.org/10.1007/978-3-030-68195-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-68195-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-68194-4
Online ISBN: 978-3-030-68195-1
eBook Packages: Computer ScienceComputer Science (R0)