نتایج جستجو برای: regular left

تعداد نتایج: 411206  

Journal: :Bulletin of the Section of Logic 2022

The aim of this manuscript is to introduce the \((\alpha,\beta)\)-hesitant fuzzy set and apply it semigroups. In paper, as a generalization concept hesitant sets semigroup theory, subsemigroups semigroups introduced, related properties are discussed. Furthermore, we define study ideals on particular, investigate structure ideal generated by in semigroup. addition, also concepts semiprime semigr...

2014
Martin Sulzmann Kenny Zhuo Ming Lu

We adapt the POSIX policy to the setting of regular expression parsing. POSIX favors longest left-most parse trees. Compared to other policies such as greedy left-most, the POSIX policy is more intuitive but much harder to implement. Almost all POSIX implementations are buggy as observed by Kuklewicz. We show how to obtain a POSIX algorithm for the general parsing problem based on Brzozowski’s ...

2009
Muhammad Shabir A. Khan

In this paper, we characterize ordered semigroups in terms of fuzzy quasi-ideals. We characterize left simple, right simple and completely regular ordered semigroups in terms of fuzzy quasi-ideals. We define semiprime fuzzy quasi-ideal of ordered semigroups and characterize completely regular ordered semigroup in terms of semiprime fuzzy quasi-ideals. We also study the decomposition of left and...

Journal: :Journal of Automata, Languages and Combinatorics 2017
Janusz A. Brzozowski Corwin Sinnamon

We study the state complexity of binary operations on regular languages over different alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on L′m and Ln is mn, and that of product (concatenation) is m2 n − 2n−1. In contrast to this, we show that if L′m and L...

Journal: :CoRR 2004
Wojciech Skut Stefan Ulrich Kathrine Hammervold

This paper describes a novel method of compiling ranked tagging rules into a deterministic nite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular expressions in both left and right rule contexts. The compiler is illustrated by an application within a speech synthesis system.

Journal: :Hacettepe journal of mathematics and statistics 2023

A ring $R$ is called right CSP if the sum of any two closed ideals also a ideal $R$. Left rings can be defined similarly. An example given to show that left may not CSP. It shown matrix over proved $\mathbb{M}_{2}(R)$ and only self-injective von Neumann regular. The equivalent characterization for trivial extension $R\propto R$

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید