Ternary Equational Languages

DOI10.1007/978-3-319-40946-7_7zbMath1484.08011OpenAlexW2487084023MaRDI QIDQ2830209

Zoltán Ésik

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Finitary algebras (08A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of the equational properties of the well-founded fixed point
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Language equations with complementation: expressive power
• Well-founded semantics for Boolean grammars
• The class of Kleene algebras satisfying an interpolation property and Nelson algebras
• Fixpoint semantics for logic programming a survey
• Boolean grammars
• FREE TERNARY ALGEBRAS
• BOOLEAN FUZZY SETS
• A Characterization of Finite Ternary Algebras
• Outline of a Theory of Truth
• A Cayley Theorem for Ternary Algebras
• Lattices With Involution
• INVOLUTED SEMILATTICES AND UNCERTAINTY IN TERNARY ALGEBRAS

This page was built for publication: Ternary Equational Languages