Skip to main content
SpringerLink
Log in

Terms and Automata Through Logic

  • Living reference work entry
  • First Online:
Handbook of Logical Thought in India

  • 27 Accesses

Abstract

This chapter gives an introduction to one kind of automata and logic connection in the setting of terms, represented as trees. Automata process terms to accept term languages, and logical formulae define such languages. There is a close connection between the formalisms. The chapter then proceeds to structures which are more general than trees but can be interpreted into trees. Automata continue to process terms; the logics can be used to define languages of the general structures. A connection is maintained through a theory of transductions. Finally the chapter generalizes terms to straight-line programs, which allow shared processing by concurrent automata, while the logic defines partially ordered sets. Here some connections have been obtained, but the picture is not complete.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Arnborg, Stefan, Jens Lagergren, and Detlef Seese. 1991. Easy problems for tree-decomposable graphs. Journal of Algorithms 122: 308–340.

    Article  Google Scholar 

  • Baader, Franz, and Tobias Nipkow. 1998. Term rewriting and all that. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Baeten, Jos, and Twan Basten. 2001. Partial order process algebra (and its relation to Petri nets). In Handbook of process algebra, ed. Jan Bergstra, Alban Ponse, and Scott Smolka, 769–872. Amsterdam: Elsevier.

    Chapter  Google Scholar 

  • Bedon, Nicolas. 2015. Logic and branching automata. Logical Methods in Computer Science 11 (4:2): 1–38.

    Google Scholar 

  • Bérard, Béatrice, Stefan Haar, and Loïc Hélouët. 2018. Hyper partial order logic. In Proceedings of 38th FSTTCS, ed. Sumit Ganguly and Paritosh Pandya, vol. 122, 20:1–20:15. Ahmedabad: Lipics.

    Google Scholar 

  • Best, Eike, and Harro Wimmel. 2000. Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets. In Proceedings of ATPN, ed. Mogens Nielsen and Dan Simpson, vol. 1825, 146–165. Aarhus: LNCS.

    Google Scholar 

  • Büchi, Richard. 1989. Finite automata, their algebras and grammars: Towards a theory of formal expressions ed. D. Siefkes. Springer.

    Google Scholar 

  • Chomsky, Noam. 1957. Syntactic structures. Mouton.

    Google Scholar 

  • Chomsky, Noam. 1965. Aspects of the theory of syntax. MIT Press.

    Google Scholar 

  • Chomsky, Noam, and Marcel-Paul Schützenberger. 1963. The algebraic theory of context-free languages. In Computer programming and formal systems, eds. P. Braffort and D. Hirschberg, 118–161. North-Holland.

    Google Scholar 

  • Comon, Hubert, Max Dauchet, Rémi Gilleron, Christof Löding, Florent Jacquemard, Denis Lugiez, Sophie Tison, and Marc Tommassi. Tree automata and their applications, online at www.grappa.univ-lille3.fr/tata.

  • Courcelle, Bruno. 1986. On context-free sets of graphs and their monadic second-order theory. In Proceedings of 3rd graph grammars, ed. Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, and Azriel Rosenfeld, vol. 291, 133–146. Warrenton: LNCS.

    Google Scholar 

  • Courcelle, Bruno, and Joost Engelfriet. 2012. Graph structure and monadic second-order logic. Cambridge University Press.

    Google Scholar 

  • Dal-Zilio, Silvano, and Denis Lugiez. 2003. XML schema, tree logic and sheaves automata. In Proceedings of 14th RTA, ed. Robert Nieuwenhuis, vol. 2706, 246–263. Valencia: LNCS.

    Google Scholar 

  • Desel, Jörg, and Javier Esparza. 2016. Negotiations and Petri nets, Trans. Petri Nets Other Models Conc. XI. LNCS 9930: 203–225.

    Google Scholar 

  • Doner, John. 1970. Tree acceptors and some of their applications. Journal of Computer and System Sciences 4: 406–451.

    Article  Google Scholar 

  • Eilenberg, Samuel, and Marcel-Paul Schützenberger. 1969. Rational sets in commutative monoids. Journal of Algebra 13 (2): 173–191.

    Article  Google Scholar 

  • Elrad, Tzilla, and Nissim Francez. 1982. Decomposition of distributed programs into communication closed layers. Science of Computer Programming 2: 155–173.

    Article  Google Scholar 

  • Ésik, Zoltán. 1999. A variety theorem for trees and theories. Universitatis Debreceniensis 54 (Suppl): 711–762.

    Google Scholar 

  • Ésik, Zoltán, and Kamal Lodaya. 2005. Notes on Petri nets and recognizability, manuscript.

    Google Scholar 

  • Ésik, Zoltán, and Pascal Weil. 2005. Algebraic recognizability of regular tree languages. Theoretical Computer Science 340: 291–321.

    Article  Google Scholar 

  • Frege, Gottlob. Begriffsschrift, a formula language, modelled upon that of arithmetic, for pure thought, in van Heijenoort, pp 5–82.

    Google Scholar 

  • Ginsburg, Seymour, and Edwin Spanier. 1966. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16 (2): 285–296.

    Article  Google Scholar 

  • Gödel, Kurt. 1931. On formally undecidable propositions of Principia Mathematica and related systems. Monatshefte für Mathematik und Physik 38: 173–198, in Van Heijenoort, pp. 596–616.

    Article  Google Scholar 

  • Goltz, Ursula, and Wolfgang Reisig. 1983. The non-sequential behaviour of Petri nets. Information and Computation 57: 125–147.

    Google Scholar 

  • Habel, Annegret, Hans-Jörg Kreowski, and Detlef Plump. 1991. Jungle evaluation. Fundamenta Informaticae 15 (1): 37–60.

    Google Scholar 

  • Halpern, Joseph, and Yoav Shoham. 1991. A propositional modal logic of time intervals. Journal of the ACM 38 (4): 935–962.

    Article  Google Scholar 

  • Herbrand, Jacques. On the consistency of arithmetic. In van Heijenoort, pp. 618–628.

    Google Scholar 

  • Hodges, Wilfrid. 1997. A shorter model theory. Cambridge University Press.

    Google Scholar 

  • Kapur, Deepak, and G. Sivakumar. 1983. Architecture of and experiments with RRL. In Proceedings of NSF workshop on RRL, eds. John Guttag, Deepak Kapur and David Musser, General Electric, pp. 33–56.

    Google Scholar 

  • Klarlund, Nils, Anders Møller, and Michael Schwartzbach. 2001. Mona implementation secrets. In Proceedings of CIAA 2000, ed. Sheng Yu and Andrei Paun, vol. 2088, 182–194. London: LNCS.

    Google Scholar 

  • Kuske, Dietrich. 2003. Towards a language theory for infinite N-free pomsets. Theoretical Computer Science 299 (1–3): 347–386.

    Article  Google Scholar 

  • Lambek, Joachim. 1958. The mathematics of sentence structure. The American Mathematical Monthly 65 (3): 154–170.

    Google Scholar 

  • Lambek, Joachim. 2008. From word to sentence: A computational algebraic approach to grammar. Polimetrika s.a.s.

    Google Scholar 

  • Lawvere, F. William. 1963. Functorial semantics of algebraic theories, PhD thesis, Columbia University.

    Google Scholar 

  • Lodaya, Kamal. 2006. Petri nets, event structures and algebra. In Formal models, languages and applications, eds. K.G. Subramanian, K. Rangarajan and Madhavan Mukund, 246–259. World Scientific.

    Google Scholar 

  • Lodaya, Kamal, and Pascal Weil. 2000. Series-parallel languages and the bounded width property. Theoretical Computer Science 237 (1–2): 347–380.

    Article  Google Scholar 

  • Lodaya, Kamal, and Pascal Weil. 2001. Rationality in algebras with a series operation. Information and Computation 171 (2): 269–293.

    Article  Google Scholar 

  • Mazurkiewicz, Antoni. 1977. Concurrent program schemes and their interpretation. DAIMI PB-78, Aarhus University.

    Google Scholar 

  • McCulloch, Warren, and Walter Pitts. 1943. A logical calculus of the ideas immanent in nervous activity. The Bulletin of Mathematical Biophysics 5: 115–133.

    Article  Google Scholar 

  • Meenakshi, B., and R. Ramanujam. 2004. Reasoning about layered message passing systems. Computer Languages, Systems and Structures 30 (3–4): 171–206.

    Article  Google Scholar 

  • Meseguer, José, and Ugo Montanari. 1990. Petri nets are monoids. Information and Computation 88: 105–155.

    Article  Google Scholar 

  • Milner, Robin. 1996. Calculi for interaction. Acta Informatica 33: 707–737.

    Article  Google Scholar 

  • Myhill, John. 1957. Finite automata and the representation of events. WADD TR-57-624.

    Google Scholar 

  • Nerode, Anil. 1958. Linear automaton transformations. Proceedings of the American Mathematical Society 9 (4): 541–544.

    Article  Google Scholar 

  • Pandya, Paritosh. 2001. Specifying and deciding quantified discrete-time duration calculus formulae using DCvalid. In Proceedings of RTtools. Aalborg: Aalborg University.

    Google Scholar 

  • Parigot, Michel, and Elisabeth Pelz. 1985. A logical approach of Petri net languages. Theoretical Computer Science 39: 155–169.

    Article  Google Scholar 

  • Parikh, Rohit. Oct 1966. On context-free languages. Journal of the ACM 13 (4): 570–581.

    Article  Google Scholar 

  • Petri, Carl-Adam. 1962. Fundamentals of a theory of asynchronous information flow. In Proceedings of 2nd IFIP, ed. C.M. Popplewell, 386–390. Munich: North-Holland.

    Google Scholar 

  • Ramachandra Phawade, and Kamal Lodaya. 2015. Kleene theorems for synchronous products with matching, Trans. Petri Nets Other Models Conc. X, in LNCS 9410, pp. 84–108.

    Google Scholar 

  • Potthoff, Andreas. 1994. Modulo-counting quantifiers over finite trees. Theoretical Computer Science 126 (1): 97–112.

    Article  Google Scholar 

  • Praveen, M., and Kamal Lodaya. 2011. Parameterized complexity results for 1-safe Petri nets. In Proceedings of concur, ed. Joost-Pieter Katoen and Barbara König, vol. 6901, 358–372. Aachen: LNCS.

    Google Scholar 

  • Presburger, Mojżesz. 1991. On the completeness of certain systems of arithmetic of whole numbers in which addition occurs as the only operation. In Proceedings of Sprawozdaniez i kongresu matematykow krajow slowianskich, Warsaw (1930). History and Philosophy of Logic 12: 92–101.

    Google Scholar 

  • Rabin, Michael. 1969. Decidability of second-order theories and automata on infinite trees. Transaction of the AMS 141: 1–35.

    Google Scholar 

  • Rabin, Michael, and Dana Scott. 1959. Finite automata and their decision problems. IBM Journal of Research and Development 3 (2): 114–125.

    Article  Google Scholar 

  • Ramanujam, R., and S. Sheerazuddin. 2016. Realizable temporal logics for web service choreography. Journal of Algebraic Methods in Logic Programming 85: 759–781.

    Article  Google Scholar 

  • Rhodes, Ida. 1961. A new approach to the mechanical syntactic analysis of Russian. Mechanical Translation 6: 33–50.

    Google Scholar 

  • Seese, Detlef. 1985. Tree-partite graphs and the complexity of algorithms. In Proceedings of 1st FCT, ed. Lothar Budach, vol. 199, 412–421. Cottbus: LNCS.

    Google Scholar 

  • Seidl, Helmut, Thomas Schwentick, and Anca Muscholl. 2008. Counting in trees. In Logic and automata, eds. Jörg Flum, Erich Grädel and Thomas Wilke, 575–612. Amsterdam University Press.

    Google Scholar 

  • Sherry, Murray, and Anthony Oettinger. 1961. A new model of natural language for predictive syntactic analysis. In Information theory, ed. Colin Cherry, 458–468. Butterworths.

    Google Scholar 

  • Åžtefănescu, Gheorghe. 2000. Network algebra. Springer.

    Google Scholar 

  • Terese. 2003. Term rewriting systems, eds. Marc Bezem, Jan Willem Klop and Roel de Vrijer. Cambridge University Press.

    Google Scholar 

  • Thatcher, James, and Jesse Wright. 1968. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2 (1): 57–81.

    Article  Google Scholar 

  • Thomas, Wolfgang. 2005. Applied automata theory, course notes, RWTH Aachen.

    Google Scholar 

  • van Heijenoort, J.. 1971. From Frege to Gödel: A source book in mathematical logic, 1879–1931, 2nd ed. Harvard University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Mathematical Sciences, Chennai, India

    Kamal Lodaya

Authors
  1. Kamal Lodaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamal Lodaya .

Editor information

Editors and Affiliations

  1. Manipal Centre for Philosophy and Humani, Manipal University, Manipal, Karnataka, India

    Sundar Sarukkai

  2. School of Cognitive Science, Jadavpur University, Kolkata, West Bengal, India

    Mihir Chakraborty

Section Editor information

  1. School of Cognitive Science, Jadavpur University, Kolkata, West Bengal, India

    Mihir Chakraborty

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature India Private Limited

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Lodaya, K. (2020). Terms and Automata Through Logic. In: Sarukkai, S., Chakraborty, M. (eds) Handbook of Logical Thought in India. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1812-8_44-1

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1812-8_44-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1812-8

  • Online ISBN: 978-81-322-1812-8

  • eBook Packages: Springer Reference Religion and PhilosophyReference Module Humanities and Social SciencesReference Module Humanities

Publish with us

Policies and ethics

Search

Navigation