Skip to main content
Log in

Weighted iterated linear control

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We combine three extensions of context-free grammars: (a) associating its nonterminals with storage configurations, (b) equipping its rules with weights, and (c) controlling its derivations. For a commutative semiring K, we introduce the class of weighted languages generated by K-weighted linear context-free grammars with storage S and with derivations controlled by (SK)-recognizable weighted languages. The control on the derivations can be iterated in a natural way. We characterize the n-th iteration of the control in terms of the n-th iteration of the one-turn pushdown operator on the storage S of the control weighted language. Moreover, for each proper semiring we prove that iterating the control yields an infinite, strict hierarchy of classes of weighted languages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. We refer to [10, Section 5] for a thorough explanation of \((\Gamma \times C)^+\).

References

  1. Aho, A.V.: Indexed grammars—an extension of context-free grammars. J. ACM 15, 647–671 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alluzen, C., Bryne, B., de Gispart, A., Igleasis, G., Riley, M.: Pushdown automata in statistical machine translation. Comput. Linguist. 40, 687–723 (2004)

    Article  MathSciNet  Google Scholar 

  3. Borodhin, H., Holzer, M., Kutrib, M.: Input reversals and iterated pushdown automata: a new characterization of Khabbaz geometric hierarchy of languages. In: Proceedings of 8th International Conference on Developments in Language Theory (DLT 2004), 13–17 Dec 2004, Auckland, New Zealand. LNCS 3340, pp. 102–113. Springer (2004)

  4. Dassow, J., Paun, G., Salomaa, A.: Grammars with controlled derivations. In: Rotenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, Chapter 3, pp. 101–154. Springer, Berlin (1986)

  5. Dassow, J., Paun, G.: Regulated Rewriting in Formal Language Theory. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (1989)

    Book  Google Scholar 

  6. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Berlin (2009)

    Google Scholar 

  7. Droste, M., Vogler, H.: The Chomsky–Schützenberger theorem for quantitative context-free languages. In: Proceedings of the 17th International Conference on Developments in Language Theory (DLT 2013), 18–21 June 2013, Paris-Est, France. LNCS 7907, pp. 203–214. Springer (2013)

  8. Droste, M., Vogler, H.: The Chomsky–Schützenberger theorem for quantitative context-free languages. Int. J. Found. Comput. Sci. 25, 955–969 (2014). arXiv:1208.3942 [cs.FL], 3 March 2016

  9. Eilenberg, S.: Automata, Languages, and Machines—Volume A. Pure and Applied Mathematics, vol. 59. Academic Press, Cambridge (1974)

    MATH  Google Scholar 

  10. Engelfriet, J.: Context–free grammars with storage. University of Leiden, 1986 (2014). arXiv:1408.0683 [cs.FL]

  11. Engelfriet, J., Vogler, H.: Pushdown machines for the macro tree transducer. Theoret. Comput. Sci. 42(3), 251–368 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ginsburg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM Control 3, 429–453 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ginsburg, S., Spanier, E.H.: Control sets on grammars. Math. Syst. Theory 2, 159–177 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  14. Golan, J.S.: Semirings and Their Applications. Kluwer Academic Publishers, Dordrecht (1999)

    Book  MATH  Google Scholar 

  15. Hebisch, U., Weinert, H.J.: Semirings—Algebraic Theory and Applications in Computer Science. World Scientific, Singapore (1998)

    MATH  Google Scholar 

  16. Herrmann, L., Vogler, H.: A Chomsky–Schützenberger theorem for weighted automata with storage. In: Maletti, A. (eds.) Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), LNCS 9270, pp. 115–127. Springer (2015)

  17. Khabbaz, N.A.: Control sets on linear grammars. Inf. Control 25, 206–221 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  18. Khabbaz, N.A.: A geometric hierarchy of languages. J. Comput. Syst. Sci. 8, 142–157 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Monographs on Theoretical Computer Science. EATCS Series, vol. 5. Springer, Berlin (1986)

    Google Scholar 

  20. Maier, R.S.: Parameterized stochastic grammars for RNA secondary structure prediction. arXiv:q-bio/0701036 [q-bio.BM] (2007)

  21. Maletti, A.: Hierarchies of tree series transducers revisited. In: Ibarra, O.H., Dang, Z. (eds.) Proceedings of the 10th International Conference Developments in Language Theory, LNCS 4036, pp. 215–225. Springer (2006)

  22. Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theory 4(3), 257–287 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  23. Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Program. 58, 206–263 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  25. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Berlin (1978)

    Book  MATH  Google Scholar 

  26. Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1, 187–212 (1967)

    Article  MATH  Google Scholar 

  27. Thatcher, J.W.: Generalized\(^2\) sequential machine maps. J. Comput. Syst. Sci. 4(4), 339–367 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  28. Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Charaterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, 1987, pp. 104–111. Association for Computational Linguistics

  29. Vogler, H.: Iterated linear control and iterated one-turn pushdowns. Math. Syst. Theory 19, 117–133 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  30. Vogler, H., Droste, M., Herrmann, L.: A weighted MSO logic with storage behaviour and its Büchi–Elgot–Trakhtenbrot theorem. In: Dediu, A.-H., et al. (eds.) LATA 2016, LNCS 9618, pp. 127–139. Springer (2016)

  31. Wang, H.: On characters of semirings. Houst. J. Math. 23(3), 391–405 (1997)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their careful reading, pointing out mistakes, and suggesting improvements.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zoltán Fülöp.

Additional information

Research of this author was supported by the NKFI Grant no K 108448.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fülöp, Z., Vogler, H. Weighted iterated linear control. Acta Informatica 56, 447–469 (2019). https://doi.org/10.1007/s00236-018-0325-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-018-0325-x

Navigation