Relevant bibliographies by topics / Boolean operation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Boolean operation'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Boolean operation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Boolean operation"

1

Butkote, R., and K. Denecke. "SEMIGROUP PROPERTIES OF BOOLEAN OPERATIONS." Asian-European Journal of Mathematics 01, no. 02 (2008): 157–75. http://dx.doi.org/10.1142/s1793557108000163.

Full text
Abstract:
A clone is a set of operations defined on a base set A which is closed under composition and contains all the projection operations. There are several ways to regard a clone as an algebraic structure (see e.g. [3]). If f, g1, … , gn : An → A are n-ary operations defined on A, then by [Formula: see text] for all a1, … , an ∈ A an n + 1-ary operation on the set On(A) of all n-ary operations can be defined. From this operation one can derive a binary operation + by [Formula: see text] and obtains a semigroup (On(A); +). In this paper we study semigroup properties of this semigroup and its subsemi
APA, Harvard, Vancouver, ISO, and other styles
2

Dasgupta, Abhijit. "Boolean operations, Borel sets, and Hausdorff's question." Journal of Symbolic Logic 61, no. 4 (1996): 1287–304. http://dx.doi.org/10.2307/2275817.

Full text
Abstract:
The study of infinitary Boolean operations was undertaken by the early researchers of descriptive set theory soon after Suslin's discovery of the important operation. The first attempt to lay down their theory in a systematic fashion was the work of Kantorovich and Livenson [5], where they call these the analytical operations. Earlier, Hausdorff had introduced the δs operations — essentially same as the monotoneω-ary Boolean operations, and Kolmogorov, independently of Hausdorff, had discovered the same objects, which were used in his study of the R operator.The ω-ary Boolean operations turned
APA, Harvard, Vancouver, ISO, and other styles
3

Zhou, Zhili, Ching-Nung Yang, Song-Ruei Cai, and Dao-Shun Wang. "Boolean Operation Based Visual Cryptography." IEEE Access 7 (2019): 165496–508. http://dx.doi.org/10.1109/access.2019.2951722.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sezgin, Aslihan, Murat Sarialioglu, and Emin Aygün. "A New Type of Extended Soft Set Operation: Complementary Extended Intersection Operation." Jurnal Matematika 14, no. 1 (2024): 75. http://dx.doi.org/10.24843/jmat.2024.v14.i01.p173.

Full text
Abstract:
Soft set theory is seen as an effective mathematical tool in solving problems involving uncertainty, and has been applied in many theoretical and practical areas since its introduction. The basic concept of the theory is soft set operations. In this context, in this paper, a new kind of soft set operations called complementary extended soft set operation is defined in order to contribute to the theory. The properties of the operation are examined in detail together with its distributions over other soft set operations in order to obtain the relationship between complementary extended intersect
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Meijun, Jiayu Qin, Gang Mei, and John C. Tipper. "Simple and Robust Boolean Operations for Triangulated Surfaces." Mathematics 11, no. 12 (2023): 2713. http://dx.doi.org/10.3390/math11122713.

Full text
Abstract:
Boolean operations on geometric models are important in numerical simulation and serve as essential tools in the fields of computer-aided design and computer graphics. The accuracy of these operations is heavily influenced by finite precision arithmetic, a commonly employed technique in geometric calculations, which introduces numerical approximations. To ensure robustness in Boolean operations, numerical methods relying on rational numbers or geometric predicates have been developed. These methods circumvent the accumulation of rounding errors during computation, thus preserving accuracy. Non
APA, Harvard, Vancouver, ISO, and other styles
6

Jin, Wen Yu, Yuan Yao, Wei Deng Chen, and Qing Xi Hu. "Boolean Operations Algorithm on Triangle Meshes for Modeling Bone Scaffold." Advanced Materials Research 421 (December 2011): 118–22. http://dx.doi.org/10.4028/www.scientific.net/amr.421.118.

Full text
Abstract:
Boolean operation is the key technology for modeling the bone scaffold. This paper proposes a Boolean operation algorithm based on triangle mesh model. It firstly voxelizes the mesh models based on project vector and octree, and classifies the vertices into inside, outside and surface type according to the position relationship between the vertex and the other mesh model’s voxel. Then the triangles can be easily classified based on the vertices class. Finally the Boolean model can be composed by the corresponding triangles of the Boolean operation. In order to obtain the intersection features
APA, Harvard, Vancouver, ISO, and other styles
7

KRISHNAN, S., D. MANOCHA, M. GOPI, T. CULVER, and J. KEYSER. "BOOLE: A BOUNDARY EVALUATION SYSTEM FOR BOOLEAN COMBINATIONS OF SCULPTURED SOLIDS." International Journal of Computational Geometry & Applications 11, no. 01 (2001): 105–44. http://dx.doi.org/10.1142/s0218195901000419.

Full text
Abstract:
In this paper we describe a system, BOOLE, that generates the boundary representations (B-reps) of solids given as a CSG expression in the form of trimmed Bézier patches. The system makes use of techniques from computational geometry, numerical linear algebra and symbolic computation to generate the B-reps. Given two solids, the system first computes the intersection curve between the two solids using our surface intersection algorithm. Using the topological information of each solid, it computes various components within each solid generated by the intersection curve and their connectivity. T
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Yi Qing, Zhi Jin Guan, Can Gang Lu, and Jin Feng He. "Iterative Construct of Reversible Network Based on Cascade Operation." Advanced Materials Research 798-799 (September 2013): 419–22. http://dx.doi.org/10.4028/www.scientific.net/amr.798-799.419.

Full text
Abstract:
Reversible logic synthesis has become a fast developing area. In order to construct reversible logic gate network, this paper presents an algorithm of iterative construct reversible network by cascade operation. The cascade operation was implemented with Boolean permutation. We proposed two important decision condition of Boolean permutation, and changed to choose balance function of suffice Boolean permutation condition for the problem of construct reversible network. The result of algorithm analysis show that it is can be implemented fleetly.
APA, Harvard, Vancouver, ISO, and other styles
9

Lopes, Diogo Chambel, Helena Mendes, Ricardo Portal, Rui de Klerk, Isabel Nogueira, and Daniel Simões Lopes. "A Usability Study on Widget Design for Selecting Boolean Operations." Multimodal Technologies and Interaction 6, no. 8 (2022): 70. http://dx.doi.org/10.3390/mti6080070.

Full text
Abstract:
Applying the correct set of Boolean operations is a fundamental task in constructive solid geometry (CSG), which is a staple in automated manufacturing systems. Although textual buttons and icons are the most common interfaces to apply such operations, these require an unnecessary cognitive load that hampers the solid modeling process. This study presents VennPad, a novel CSG widget that gathers all Boolean operations under the same user interface control element and is represented as a two-set Venn diagram. Contrary to conventional CSG widgets, VennPad supports a graphical interface that give
APA, Harvard, Vancouver, ISO, and other styles
10

OKHOTIN, ALEXANDER. "GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS." International Journal of Foundations of Computer Science 17, no. 03 (2006): 629–64. http://dx.doi.org/10.1142/s0129054106004029.

Full text
Abstract:
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which reverses a previously made reduction. This operation makes the mathematical justification of the algorithm significantly different from its prototype. On the other hand, the changes in the implementation are not very substantial, and the algorithm st
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Boolean operation"

1

Lai, Shuhua. "Subdivision Surface based One-Piece Representation." UKnowledge, 2006. http://uknowledge.uky.edu/gradschool_diss/330.

Full text
Abstract:
Subdivision surfaces are capable of modeling and representing complex shapes of arbi-trary topology. However, methods on how to build the control mesh of a complex surfaceare not studied much. Currently, most meshes of complicated objects come from trian-gulation and simplification of raster scanned data points, like the Stanford 3D ScanningRepository. This approach is costly and leads to very dense meshes.Subdivision surface based one-piece representation means to represent the final objectin a design process with only one subdivision surface, no matter how complicated theobject's topology or
APA, Harvard, Vancouver, ISO, and other styles
2

Koshta, Prashant Kumar, and Shailendra Singh Thakur. "A Novel Authenticity of an Image Using Visual Cryptography." IJCSN, 2012. http://hdl.handle.net/10150/219514.

Full text
Abstract:
Information security in the present era is becoming very important in communication and data storage. Data transferred from one party to another over an insecure channel (e.g., Internet) can be protected by cryptography. The encrypting technologies of traditional and modern cryptography are usually used to avoid the message from being disclosed. Public-key cryptography usually uses complex mathematical computations to scramble the message.<br>A digital signature is an important public-key primitive that performs the function of conventional handwritten signatures for entity authentic
APA, Harvard, Vancouver, ISO, and other styles
3

Rota, Pascal. "Boolean operations on point set surfaces." Zürich : ETH, Swiss Federal Institute of Technology Zurich, Department of Computer Science, Institute of Computational Science, 2008. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=363.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LEAL, HELOISA REIS. "BOOLEAN OPERATIONS ON POINT-BASED MODELS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5881@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Operações booleanas em modelagem 3D são usadas para criar novos modelos ou para modificá-los. Na maioria dos tipos de representação de objetos 3D, estas operações são bastante complexas. Nos últimos anos tem sido muito explorado um novo tipo de modelagem, a modelagem por pontos, que apresenta muitas vantagens em relação às outras representações como maior simplicidade e eficiência. Dois trabalhos exploram as operações booleanas na modelagem por pontos, o trabalho de Adams e Dutré e o trabalho de Pauly et. al. Dada a grande importância deste
APA, Harvard, Vancouver, ISO, and other styles
5

Saeed, Saif Eldin Osman. "Boundary merging in Boolean and offsetting operations." Thesis, University of Leeds, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

ARRUDA, MARCOS CHATAIGNIER DE. "BOOLEAN OPERATIONS WITH COMPOUND SOLIDS REPRESENTED BY BOUNDARY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6688@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>TECNOLOGIA EM COMPUTAÇÃO GRÁFICA<br>Num modelador de sólidos, uma das ferramentas mais poderosas para a criação de objetos tridimensionais de qualquer nível de complexidade geométrica é a aplicação das operações booleanas. Elas são formas intuitivas e populares de combinar sólidos, baseadas nas operações aplicadas a conjuntos. Os tipos principais de operações booleanas comumente aplicadas a sólidos são: união, interseção e diferença. Havendo interesse prático, para garantir que os objetos resultantes possuam a mesma dimensão
APA, Harvard, Vancouver, ISO, and other styles
7

Sheng, James Min. "Efficient geographic information systems : data structures, Boolean operations and concurrency control /." Online version of thesis, 1990. http://hdl.handle.net/1850/10594.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stab, Olivier. "Maillage automatique tridimensionnel par operations booleennes." Paris, ENMP, 1992. http://www.theses.fr/1992ENMP0377.

Full text
Abstract:
Le domaine d'etude est l'algorithmique geometrique applique aux problemes du maillage automatique de geometries tridimensionnelles complexes. L'utilisation de la methode des elements finis pour simuler numeriquement le comportement de phenomenes physiques reste delicate ou fastidieuse a cause de l'etape du maillage qui pose de nombreux problemes en trois dimensions. Dans cette these on propose une nouvelle approche: le maillage par operations booleennes. Elle consiste a calculer un maillage comme une union, une difference ou une intersection entre deux domaines mailles. Deux methodes sont decr
APA, Harvard, Vancouver, ISO, and other styles
9

Fratzeskou, Eugenia. "Visualising Boolean set operations : real and virtual boundaries in contemporary site-specific art." Thesis, University of Surrey, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.425040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gaffney, Christopher T. "The application of the inclusion-exclusion principle in learning monotone boolean functions." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Boolean operation"

1

Boole, George. Derivation of the laws of the symbols of logic from the laws of the operations of the human mind: An excerpt from the writings of George Boole. St. Sebastian Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vladimirov, D. A. Boolean Algebras in Analysis. Springer, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vladimirov, D. A. Boolean Algebras in Analysis. Springer Netherlands, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hammer, P. L., S. Rudeanu, and R. Bellmann. Boolean Methods in Operations Research and Related Areas. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hammer, P. L., S. Rudeanu, and R. Bellmann. Boolean Methods in Operations Research and Related Areas. Springer London, Limited, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ricker, Werner. Operator Algebras Generated by Commuting Projections: A Vector Measure Approach. Springer London, Limited, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Introduction to Digital Logic and Boolean Algebra: A Comprehensive Guide to Binary Operations, Logic Gates, Logical Expression Analysis and Number Representations in Digital Technology. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Anderson, James A. Software. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780199357789.003.0004.

Full text
Abstract:
Digital computers are “protean” in that they can become almost anything through software. Their basic design elements came from a 19th-century British tradition in logic, exemplified by Boole and Babbage. It seemed natural to have logic realized in hardware. This tradition culminated in the work of Alan Turing who proposed a universal computing machine, now called a Turing machine, based on logic. Although hardware that computes logic functions lies at the core of digital hardware, low-level practical machine operations are grouped together in “words.” Programs are based on hardware operations
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Boolean operation"

1

Weik, Martin H. "Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1768.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weik, Martin H. "Boolean add operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1763.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weik, Martin H. "Boolean operation table." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1769.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Weik, Martin H. "Boolean set operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1771.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Weik, Martin H. "monadic Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11772.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Weik, Martin H. "binary Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1519.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Weik, Martin H. "dyadic Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_5719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Weik, Martin H. "n-adic Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Weik, Martin H. "n-ary Boolean operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Weik, Martin H. "regularized Boolean set operation." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_15907.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Boolean operation"

1

Takiguchi, Koichi, and Hironori Nishihara. "Flexible Opto-electronic Logical Gate Circuit Comprising Waveguide-based Interferometer and Photodetector." In Integrated Photonics Research, Silicon and Nanophotonics. Optica Publishing Group, 2024. http://dx.doi.org/10.1364/iprsn.2024.itu2b.3.

Full text
Abstract:
We report an opto-electronic logical gate with flexible operation, which consists of an integrated-optic symmetric Mach-Zehnder interferometer and a balanced photodetector. We show Boolean AND and NAND computations of 40 Gbit/s signals with the gate.
APA, Harvard, Vancouver, ISO, and other styles
2

Chang, Jianing, Erbao Du, Shijin Zhang, Yuqiang Wu, and Qian Peng. "A Method of Integrating Spatial Division Strategy with Parallelized Boolean Operation to Speed-Up Machining Process Simulation." In 2025 6th International Conference on Mechatronics Technology and Intelligent Manufacturing (ICMTIM). IEEE, 2025. https://doi.org/10.1109/icmtim65484.2025.11040944.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lee, Shinhyoung, Seehwan Yoo, Sangsun Byun, and Chuck Yoo. "BO-Multicast: Boolean Operation Multicast." In 2006 Asia-Pacific Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/apcc.2006.255950.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shibata, Hiroki, Hiroki Sato, Lieu-Hen Chen, and Yasufumi Takama. "Introduction of Boolean Operation into Context Search Engine." In 2020 International Symposium on Community-centric Systems (CcS). IEEE, 2020. http://dx.doi.org/10.1109/ccs49175.2020.9231408.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Liangchen, Dan Wang, Yehua Sheng, Yongjun Wang, and Pan Li. "Three dimensional Boolean operation based on L-Rep model." In 2010 18th International Conference on Geoinformatics. IEEE, 2010. http://dx.doi.org/10.1109/geoinformatics.2010.5567913.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Verma, Monu, and Rajneesh Rani. "Strong threshold secret image sharing based on boolean operation." In 2016 International Conference on Computing, Communication and Automation (ICCCA). IEEE, 2016. http://dx.doi.org/10.1109/ccaa.2016.7813889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yanxi, Li, Zhu Dongmei, Zou Xiaohui, Xiao Xu, and He Ketai. "Exact boolean operation on triangulated meshes using accelerated BSPs." In 2023 IEEE 18th Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2023. http://dx.doi.org/10.1109/iciea58696.2023.10241911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pu Keming and Xu Yuanyuan. "Real-time Boolean operation for NC machining in virtual simulation." In 2010 International Conference on Computer Application and System Modeling (ICCASM 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccasm.2010.5622597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kapadiya, Vishakha J., Laxmi S. Desai, and Yogesh K. Meghrajani. "Visual Secret Sharing Technique for Meaningful Shares using Boolean Operation." In 2018 International Conference on Advanced Computation and Telecommunication (ICACAT). IEEE, 2018. http://dx.doi.org/10.1109/icacat.2018.8933540.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mai, Quan, Susan Gauch, and Douglas Adams. "SetBERT: Enhancing Retrieval Performance for Boolean Logic and Set Operation Queries." In NLPIR 2024: 2024 8th International Conference on Natural Language Processing and Information Retrieval. ACM, 2024. https://doi.org/10.1145/3711542.3711548.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Boolean operation"

1

Baader, Franz, Conrad Drescher, Hongkai Liu, et al. Putting ABox Updates into Action. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.170.

Full text
Abstract:
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, updates generate so-called Boolean ABoxes, which cannot be handled by traditional Description Logic reasoners. Second, iterated update operations result in very large Boolean ABoxes, which, however, contain a huge amount of redundant information. In this paper, we address both issues from a practical point of view.
APA, Harvard, Vancouver, ISO, and other styles
2

Baader, Franz, and Alexander Okhotin. Solving Language Equations and Disequations Using Looping Tree Automata with Colors. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.185.

Full text
Abstract:
We extend previous results on the complexity of solving language equations with one-sided concatenation and all Boolean operations to the case where also disequations (i.e., negated equations) may occur. To show that solvability of systems of equations and disequations is still in ExpTime, we introduce a new type of automata working on infinite trees, which we call looping automata with colors. As applications of these results, we show new complexity results for disunification in the description logic FL₀ and for monadic set constraints with negation. We believe that looping automata with colo
APA, Harvard, Vancouver, ISO, and other styles
3

Baader, Franz, and Alexander Okhotin. On Language Equations with One-sided Concatenation. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.154.

Full text
Abstract:
Language equations are equations where both the constants occurring in the equations and the solutions are formal languages. They have first been introduced in formal language theory, but are now also considered in other areas of computer science. In the present paper, we restrict the attention to language equations with one-sided concatenation, but in contrast to previous work on these equations, we allow not just union but all Boolean operations to be used when formulating them. In addition, we are not just interested in deciding solvability of such equations, but also in deciding other prop
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Boolean operation' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography