On languages over an alphabet interpreted in a boolean algebra

DOI10.1007/BF02366517zbMath0847.68058OpenAlexW2094872291MaRDI QIDQ1918741

S. V. Surzhko, E. L. Yushchenko

Publication date: 25 August 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366517

zbMATH Keywords

Boolean algebralanguages over an alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Approach to the construction of algebraic models of algorithms and programs

This page was built for publication: On languages over an alphabet interpreted in a boolean algebra