On the Density of Context-Free and Counter Languages
- 425 Downloads
A language L is said to be dense if every word in the universe is an infix of some word in L. This notion has been generalized from the infix operation to arbitrary word operations \(\varrho \) in place of the infix operation (\(\varrho \)-dense, with infix-dense being the standard notion of dense). It is shown here that it is decidable, for a language L accepted by a one-way nondeterministic reversal-bounded pushdown automaton, whether L is infix-dense. However, it becomes undecidable for both deterministic pushdown automata (with no reversal-bound), and for nondeterministic one-counter automata. When examining suffix-density, it is undecidable for more restricted families such as deterministic one-counter automata that make three reversals on the counter, but it is decidable with less reversals. Other decidability results are also presented on dense languages, and contrasted with a marked version called \(\varrho \)-marked-density. Also, new languages are demonstrated to be outside various deterministic language families after applying different deletion operations from smaller families. Lastly, bounded-dense languages are defined and examined.
Unable to display preview. Download preview PDF.
- 1.Autebert, J., Berstel, J., Boasson, L.: Handbook of Formal Languages, vol. 1, chap. Context-Free Languages and Pushdown Automata. Springer-Verlag, Berlin (1997)Google Scholar
- 5.Eremondi, J., Ibarra, O.H., McQuillan, I.: Deletion operations on deterministic families of automata. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 388–399. Springer, Heidelberg (2015) Google Scholar
- 7.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979) Google Scholar
- 13.Shyr, H.J.: Free Monoids and Languages, 3rd edn. Hon Min Book Company, Taichung (2001)Google Scholar