Abstract
Non-self-embedding grammars are a restriction of context-free grammars which does not allow to describe recursive structures and, hence, which characterizes only the class of regular languages. A double exponential gap in size from non-self-embedding grammars to deterministic finite automata is known. The same size gap is also known from constant-height pushdown automata and 1-limited automata to deterministic finite automata. Constant-height pushdown automata and 1-limited automata are compared with non-self-embedding grammars. It is proved that non-self-embedding grammars and constant-height pushdown automata are polynomially related in size. Furthermore, a polynomial size simulation by 1-limited automata is presented. However, the converse transformation is proved to cost exponential.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anselmo, M., Giammarresi, D., Varricchio, S.: Finite automata and non-self-embedding grammars. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 47–56. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44977-9_4
Bednárová, Z., Geffert, V., Mereghetti, C., Palano, B.: Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237, 257–267 (2014)
Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137–167 (1959)
Chomsky, N.: A note on phrase structure grammars. Inf. Control 2(4), 393–395 (1959)
Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208(4), 385–394 (2010)
Hibbard, T.N.: A generalization of context-free determinism. Inf. Control 11(1/2), 196–238 (1967)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley-Longman, Reading (2001)
Kelemenová, A.: Complexity of normal form grammars. Theor. Comput. Sci. 28, 299–314 (1984)
Kutrib, M., Wendlandt, M.: On simulation cost of unary limited automata. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 153–164. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19225-3_13
Mereghetti, C., Pighizzini, G.: Two-way automata simulations and unary languages. J. Automata Lang. Comb. 5(3), 287–300 (2000)
Ogden, W.F., Ross, R.J., Winklmann, K.: An “interchange lemma” for context-free languages. SIAM J. Comput. 14(2), 410–415 (1985)
Pighizzini, G.: Deterministic pushdown automata and unary languages. Int. J. Found. Comput. Sci. 20(4), 629–645 (2009)
Pighizzini, G., Pisoni, A.: Limited automata and regular languages. Int. J. Found. Comput. Sci. 25(7), 897–916 (2014)
Pighizzini, G., Prigioniero, L.: Limited automata and unary languages. In: Charlier, É., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 308–319. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62809-7_23
Pighizzini, G., Prigioniero, L.: Non-self-embedding grammars and descriptional complexity. NCMA 2017, 197–209 (2017)
Wagner, K.W., Wechsung, G.: Computational Complexity. D. Reidel Publishing Company, Dordrecht (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Guillon, B., Pighizzini, G., Prigioniero, L. (2018). Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. In: Câmpeanu, C. (eds) Implementation and Application of Automata. CIAA 2018. Lecture Notes in Computer Science(), vol 10977. Springer, Cham. https://doi.org/10.1007/978-3-319-94812-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-94812-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94811-9
Online ISBN: 978-3-319-94812-6
eBook Packages: Computer ScienceComputer Science (R0)