References

  1. J. Ahsan, J.N. Mordeson & M. Shabir (2012): Fuzzy Semirings with Applications to Automata Theory. Studies in Fuzziness and Soft Computing. Springer-Verlag, doi:10.1007/978-3-642-27641-5.
  2. A. Avron & B. Konikowska (2009): Proof Systems for Reasoning about Computation Errors. Studia Logica 91(2), pp. 273–293, doi:10.1007/s11225-009-9175-4.
  3. J. R. Büchi (1960): Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, pp. 66–92, doi:10.1002/malq.19600060105.
  4. D.M. Cerna, W. Schreiner & T. Kutsia (2016): Predicting Space Requirements for a Stream Monitor Specification Language. In: Y. Falcone & C. Sánchez: Runtime Verification - 16th International Conference, RV 2016, pp. 135–151, doi:10.1007/978-3-319-46982-9_9.
  5. M. \'Ciri\'c, M. Droste, J. Ignjatovi\'c & H. Vogler (2010): Determinization of weighted finite automata over strong bimonoids. Inform. Sci. 180(18), pp. 3497–3520, doi:10.1016/j.ins.2010.05.020.
  6. M. Droste & P. Gastin (2007): Weighted automata and weighted logics. Theoret. Comput. Sci. 380, pp. 69–86, doi:10.1016/j.tcs.2007.02.055.
  7. M. Droste, W. Kuich & H. Vogler (2009): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin Heidelberg, doi:10.1007/978-3-642-01492-5.
  8. M. Droste & D. Kuske: Weighted automata. In: J.-E. Pin: Handbook: Automata: from Mathematics to Applications, chapter 4. Available at http://eiche.theoinf.tu-ilmenau.de/kuske/Submitted/weighted.pdf. To appear..
  9. M. Droste, I. Meinecke, B. Šešelja & A. Tepavčevi\'c (2012): Coverings and Decompositions of Semiring-Weighted Finite Transition Systems, chapter 11, in Ah:Fu, doi:10.1007/978-3-642-27641-5_11.
  10. M. Droste, T. Stüber & H. Vogler (2010): Weighted finite automata over strong bimonoids. Inform. Sci. 180(1), pp. 156–166, doi:10.1016/j.ins.2009.09.003.
  11. C.C. Elgot (1961): Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98(1), pp. 21–51, doi:10.1090/S0002-9947-1961-0139530-9.
  12. S.C. Kleene (1952): Introduction to Metamathematics. North-Holland.
  13. B. Konikowska (2009): Four-Valued Logic for Reasoning about Finite and Infinite Computation Errors in Programs. In: W. Carnielli, M.E. Coniglio & I.M. Loffredo D'Ottaviano: The Many Sides of Logic, Studies in Logic. College Publications, pp. 403–423.
  14. T. Kutsia & W. Schreiner (2012): LogicGuard Abstract Language. RISC Report Series 12-08. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria.
  15. P. Li, Y. Li & S. Geng (2014): The realization problems related to weighted transducers over strong bimonoids. In: IEEE International Conference on Fuzzy Systems 2014, Fuzzy Systems (FUZZ-IEEE), pp. 1686–1690, doi:10.1109/FUZZ-IEEE.2014.6891580.
  16. LogicGuard I. http://www.risc.jku.at/projects/LogicGuard/.
  17. LogicGuard II. http://www.risc.jku.at/projects/LogicGuard2/.
  18. J. McCarthy (1967): A basis for a mathematical theory of computation, Computer Programming and Formal Systems. North-Holland, doi:10.1145/1460690.1460715.
  19. J. N. Mordeson & D.S. Malik (2002): Fuzzy Automata and Languages, Theory and Applications. Computational Mathematics Series. Chapman and Hall, doi:10.1201/9781420035643.
  20. M. Nivat (1968): Transductions des langages de Chomsky. Ann. de l'Inst. Fourier 18, pp. 339–456, doi:10.5802/aif.287.
  21. G. Rahonis (2009): Fuzzy languages, chapter 12, in Dr:Han, doi:10.1007/978-3-642-01492-5_12.
  22. W. Thomas (1994): Languages, automata, and logic. In: Grzegorz Rozenberg & Arto Salomaa: Handbook of Formal Languages vol. 3. Spinger, pp. 389–455, doi:10.1007/978-3-642-59126-6.
  23. B. Trakhtenbrot (1961): Finite automata and logic of monadic predicates. Doklady Akademii Nauk SSSR 140, pp. 326–329. (in Russian).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org