Skip to main content
SpringerLink
Log in

Ternary Equational Languages

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9705))

Included in the following conference series:

  • 483 Accesses

Abstract

We present a general method for solving fixed point equations involving pseudo-complementation over complete ternary algebras satisfying some infinite distributivity conditions as generalized truth values, and finitely decomposable algebras as data domains. When the algebra of data domains is a word or a tree algebra, fixed point equations may be interpreted as grammars and we obtain wide classes of (fuzzy) languages and tree languages.

Z. Ésik—Partially supported by the NKFI grant no. 108488.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Actually [5] uses a dual construction.

  2. 2.

    Actually a dual operation and a dual ordering are defined in [4].

References

  1. Balbes, R.: Free ternary algebras. IJAC 10(6), 739–749 (2000)

    MathSciNet  MATH  Google Scholar 

  2. Balbes, R., Dwinger, P.: Distributive Lattices. University of Missouri Press, Columbia (1974)

    MATH  Google Scholar 

  3. Bloom, S.L., Ésik, Z.: Iteration Theories. Springer, Heidelberg (1993)

    Book  MATH  Google Scholar 

  4. Brzozowski, J.A.: Involuted semilattices and uncertainty in ternary algebras. IJAC 14(3), 295–310 (2004)

    MathSciNet  MATH  Google Scholar 

  5. Brzozowski, J.A., Lou, J.J., Negulescu, R.: A characterization of finite ternary algebras. IJAC 7(6), 713–722 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Brzozowski, J.A., Seeger, C.J.: Asynchronous Circuits. Springer, Berlin (1995)

    Book  Google Scholar 

  7. Carayol, A., Ésik, Z.: An analysis of the equational properties of the well-founded fixed point, arXiv:1511.09423 (2015)

  8. Cignoli, R.: The class of Kleene algebras satisfying the interpolation property and Nelson algebras. Alg. Univ. 23, 262–292 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  10. Ésik, Z.: A Cayley theorem for ternary algebras. IJAC 8(3), 311–316 (1998)

    MathSciNet  MATH  Google Scholar 

  11. Ésik, Z., Kuich, W.: Boolean fuzzy sets. IJFCS 18(6), 1197–1207 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Fitting, M.: Fixpoint semantics for logic programming–a survey. TCS 278(1–2), 25–51 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Figallo, A.V., Gomes, C.M., Sarmiento, L.S., Videla, M.E.: Notes on the variety of ternary algebras. Adv. Pure Math. 4, 506–512 (2014)

    Article  Google Scholar 

  14. Jezek, J.: Universal Algebra, 1st edn. (2008). http://www.karlin.mff.cuni.cz/~jezek/

  15. Kalman, J.A.: Lattices with involution. Trans. Amer. Math. Soc. 87, 485–491 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for Boolean grammars. Inf. Comput. 207(9), 945–967 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kripke, S.: Outline of a theory of truth. J. Philos. 72, 690–716 (1975)

    Article  MATH  Google Scholar 

  18. Leiss, E.L.: Language Equations. Springer, New York (1999)

    Book  MATH  Google Scholar 

  19. Okhotin, A.: Boolean grammars. Inf. Comput. 194(1), 19–48 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  20. Okhotin, A., Yakimova, O.: Language equations with complementation: expressive power. TCS 416, 71–86 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  21. Okhotin, A.: Conjunctive and Boolean grammars: the true general case of the context-free grammars. Comput. Sci. Rev. 9, 27–59 (2013)

    Article  MATH  Google Scholar 

Download references

Acknowledgment

The author would like to thank the referees for useful suggestions.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Szeged, Szeged, 6720, Hungary

    Zoltán Ésik

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zoltán Ésik .

Editor information

Editors and Affiliations

  1. Yonsei University, Seoul, Korea (Republic of)

    Yo-Sub Han

  2. Queen's University , Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Ésik, Z. (2016). Ternary Equational Languages. In: Han, YS., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2016. Lecture Notes in Computer Science(), vol 9705. Springer, Cham. https://doi.org/10.1007/978-3-319-40946-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40946-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40945-0

  • Online ISBN: 978-3-319-40946-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation