References

  1. S. Almagor & O. Kupferman (2011): Max and sum Semantics for alternating weighted automata. In: T. Bultan & P. Hsiung: Automated Technology for Verification and Analysis. Springer, pp. 13–27, doi:10.1007/978-3-642-24372-1_2.
  2. M. Benedikt, Duffm T., A. Sharad & J. Worrell (2017): Polynomial automata: Zeroness and applications. In: ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–12, doi:10.1109/LICS.2017.8005101. Available at https://ora.ox.ac.uk/objects/uuid:f341421b-2130-42d7-bb21-52442bad0b80#citeForm.
  3. J.A. Brzozowski & E. Leiss (1980): On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science 10(1), pp. 19–35, doi:10.1016/0304-3975(80)90069-9. Available at https://www.sciencedirect.com/science/article/pii/0304397580900699.
  4. A. K. Chandra, D. C. Kozen & L. J. Stockmeyer (1981): Alternation. J. ACM 28(1), pp. 114–133, doi:10.1145/322234.322243.
  5. K. Chatterjee, L. Doyen & T. A. Henzinger (2008): Quantitative languages. In: M. Kaminski & S. Martini: Computer Science Logic. Springer, pp. 385–400, doi:10.1007/978-3-540-87531-4_28.
  6. K. Chatterjee, L. Doyen & T. A. Henzinger (2009): Alternating Weighted Automata. In: M. Kutyłowski, W. Charatonik & M. Gębala: Fundamentals of Computation Theory. Springer, pp. 3–13, doi:10.1007/978-3-642-03409-1_2.
  7. E. Muller D & P. E. Schupp (1987): Alternating automata on infinite trees. Theoretical Computer Science 54(2), pp. 267–276, doi:10.1016/0304-3975(87)90133-2. Available at https://www.sciencedirect.com/science/article/pii/0304397587901332.
  8. G. De Giacomo & M. Y. Vardi (2013): Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. AAAI Press, pp. 854–860, doi:10.5555/2540128.2540252. Available at http://dl.acm.org/citation.cfm?id=2540128.2540252.
  9. M. Droste & S. Dück (2015): Weighted automata and logics on graphs. In: G. F. Italiano, G. Pighizzini & D. T. Sannella: Mathematical Foundations of Computer Science 2015. Springer, pp. 192–204, doi:10.1007/978-3-662-48057-1_15.
  10. M. Droste & P. Gastin (2007): Weighted automata and weighted logics. Theoretical Computer Science 380(1), pp. 69–86, doi:10.1016/j.tcs.2007.02.055. Available at https://www.sciencedirect.com/science/article/pii/S0304397507001582. Automata, Languages and Programming.
  11. M. Droste & P. Gastin (2009): Weighted Automata and Weighted Logics, chapter 5 1. In: Droste, doi:10.1007/978-3-642-01492-5_5.
  12. M. Droste & D. Götze (2017): A Nivat theorem for quantitative automata on unranked trees. In: Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, pp. 22–35, doi:10.1007/978-3-319-63121-9_2.
  13. M. Droste, W. Kuich & H. Vogler (2009): Handbook of Weighted Automata, 1st edition 1. Springer, doi:10.1007/978-3-642-01492-5.
  14. M. Droste & D. Kuske (2021): Weighted automata, pp. 113–150 1. In: Pin, doi:10.4171/Automata-1/4.
  15. M. Droste & H. Vogler (2006): Weighted tree automata and weighted logics. Theoretical Computer Science 366(3), pp. 228 – 247, doi:10.1016/j.tcs.2006.08.025. Available at http://www.sciencedirect.com/science/article/pii/S0304397506005676. Automata and Formal Languages.
  16. M. Droste & H. Vogler (2011): Weighted logics for unranked tree automata. Theory of Computing Systems 48(1), pp. 23–47, doi:10.1007/s00224-009-9224-4.
  17. Z. Fülöp & H. Vogler (2009): Weighted Tree Automata and Tree Transducers, chapter 9 1. In: Droste, doi:10.1007/978-3-642-01492-5_9.
  18. P. Kostolányi & F. Mišún (2018): Alternating weighted automata over commutative semirings. Theoret. Comput. Sci. 740, pp. 1 – 27, doi:10.1016/j.tcs.2018.05.003. Available at http://www.sciencedirect.com/science/article/pii/S0304397518303098.
  19. J. van Leeuwen (1995): Computer Science Today: Recent Trends and Developments 1. Springer, doi:10.1007/BFb0015232.
  20. M. Nivat (1968): Transductions des langages de Chomsky. Annales de l'Institut Fourier 18(1), pp. 339–455, doi:10.5802/aif.287. Available at http://www.numdam.org/articles/10.5802/aif.287/.
  21. Jean-Éric Pin (2021): Handbook of Automata Theory, 1st edition 1. European Mathematical Society, doi:10.4171/Automata.
  22. M.P. Schützenberger (1961): On the definition of a family of automata. Inform. and Control 4(2), pp. 245 – 270, doi:10.1016/S0019-9958(61)80020-X. Available at http://www.sciencedirect.com/science/article/pii/S001999586180020X.
  23. M. Y. Vardi (1995): Alternating automata and program verification, pp. 471–485 1. In: van Leeuwen, doi:10.1007/BFb0015261.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org