Skip to main content

An Automata Theoretic Characterization of Weighted First-Order Logic

  • Conference paper
  • First Online:
Automated Technology for Verification and Analysis (ATVA 2023)

Abstract

Since the 1970s with the work of McNaughton, Papert and Schützenberger [21, 23], a regular language is known to be definable in the first-order logic if and only if its syntactic monoid is aperiodic. This algebraic characterisation of a fundamental logical fragment has been extended in the quantitative case by Droste and Gastin [10], dealing with polynomially ambiguous weighted automata and a restricted fragment of weighted first-order logic. In the quantitative setting, the full weighted first-order logic (without the restriction that Droste and Gastin use, about the quantifier alternation) is more powerful than weighted automata, and extensions of the automata with two-way navigation, and pebbles or nested capabilities have been introduced to deal with it [5, 19]. In this work, we characterise the fragment of these extended weighted automata that recognise exactly the full weighted first-order logic, under the condition that automata are polynomially ambiguous.

We thank the reviewers that helped greatly improving the readability of this article. The work was partially done during an internship of the first author at Aix-Marseille Université, partially funded by CNRS IRL 2000 ReLaX.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In the proof of Theorem 3, we replace this construction by the use of nesting that allows one to restart from the first position of the word in order to compute the behaviour of either \(\mathcal {A}_1\) or \(\mathcal {A}_2\).

References

  1. Birget, J.C.: Concatenation of inputs in a two-way automaton. Theoret. Comput. Sci. 63(2), 141–156 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  2. Birget, J.C.: Two-way automaton computations. RAIRO-Theor. Inform. Appl. 24(1), 47–66 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bollig, B., Gastin, P., Monmege, B.: Weighted specifications over nested words. In: Pfenning, F. (ed.) FoSSaCS 2013. LNCS, vol. 7794, pp. 385–400. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37075-5_25

    Chapter  Google Scholar 

  4. Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Logical characterization of weighted pebble walking automata. In: CSL-LICS 2014. ACM (2014). https://doi.org/10.1145/2603088.2603118

  5. Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: Pebble weighted automata and weighted logics. ACM Trans. Comput. Log. 15(2:15) (2014). https://doi.org/10.1145/2579819

  6. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift Math. Log. Grundlagen Math. 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  7. Carton, O., Dartois, L.: Aperiodic two-way transducers and FO-transductions. Research Report 2103.15651, arXiv (2021)

    Google Scholar 

  8. Dhruv, N., Monmege, B.: An automata theoretic characterization of weighted first-order logic. Research Report 2307.14707, arXiv (2023). https://arxiv.org/abs/2307.14707

  9. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoret. Comput. Sci. 380(1–2), 69–86 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Droste, M., Gastin, P.: Aperiodic weighted automata and weighted first-order logic. In: MFCS 2019. No. 76 in LIPIcs, Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.MFCS.2019.76

  11. Droste, M., Götze, D., Märcker, S., Meinecke, I.: Weighted tree automata over valuation monoids and their characterization by weighted logics. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 30–55. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24897-9_2

    Chapter  Google Scholar 

  12. Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science, Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5

    Book  MATH  Google Scholar 

  13. Droste, M., Meinecke, I.: Weighted automata and weighted MSO logics for average and long-time behaviors. Inf. Comput. 220–221, 44–59 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Droste, M., Pibaljommee, B.: Weighted nested word automata and logics over strong bimonoids. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 138–148. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31606-7_12

    Chapter  MATH  Google Scholar 

  15. Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 49–58. Springer, Heidelberg (2006). https://doi.org/10.1007/11779148_6

    Chapter  Google Scholar 

  16. Droste, M., Vogler, H.: Weighted logics for unranked tree automata. Theory Comput. Syst. 48, 23–47 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98, 21–52 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fülöp, Z., Stüber, T., Vogler, H.: A Büchi-like theorem for weighted tree automata over multioperator monoids. Theory Comput. Syst. 50, 241–278 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gastin, P., Monmege, B.: Adding pebbles to weighted automata: easy specification and efficient evaluation. Theoret. Comput. Sci. 534, 24–44 (2014). https://doi.org/10.1016/j.tcs.2014.02.034

    Article  MathSciNet  MATH  Google Scholar 

  20. Gastin, P., Monmege, B.: A unifying survey on weighted logics and weighted automata. Soft. Comput. 22(4), 1047–1065 (2015). https://doi.org/10.1007/s00500-015-1952-6

    Article  MATH  Google Scholar 

  21. McNaughton, R.F., Papert, S.A.: Counter-Free Automata, vol. 65. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  22. Schützenberger, M.P.: On the definition of a family of automata. Inf. Control 4, 245–270 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  23. Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  24. Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Dokl. Akad. Nauk SSSR 149, 326–329 (1961)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Benjamin Monmege .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nevatia, D., Monmege, B. (2023). An Automata Theoretic Characterization of Weighted First-Order Logic. In: André, É., Sun, J. (eds) Automated Technology for Verification and Analysis. ATVA 2023. Lecture Notes in Computer Science, vol 14215. Springer, Cham. https://doi.org/10.1007/978-3-031-45329-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45329-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45328-1

  • Online ISBN: 978-3-031-45329-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics