DFAs and PFAs with Long Shortest Synchronizing Word Length

It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$ states always has a shortest synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all DFAs reaching this bound was only given for $n \leq 4$, and with bounds on the number of symbols for $n \leq 10$. Here we give the full analysis for $n \leq 6$, without bounds on the number of symbols. For PFAs the bound is much higher. For $n \leq 6$ we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, exceeding $(n-1)^2$ for $n =4,5,6$. For arbitrary n we give a construction of a PFA on three symbols with exponential shortest synchronizing word length, giving significantly better bounds than earlier exponential constructions. We give a transformation of this PFA to a PFA on two symbols keeping exponential shortest synchronizing word length, yielding a better bound than applying a similar known transformation.Comment: 16 pages, 2 figures source code adde

Most Complex Non-Returning Regular Languages

A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jir\'askov\'a derived upper bounds on the state complexity of boolean operations and Kleene star, and proved that these bounds are tight using two different binary witnesses. They derived upper bounds for concatenation and reversal using three different ternary witnesses. These five witnesses use a total of six different transformations. We show that for each $n\ge 4$ there exists a ternary witness of state complexity $n$ that meets the bound for reversal and that at least three letters are needed to meet this bound. Moreover, the restrictions of this witness to binary alphabets meet the bounds for product, star, and boolean operations. We also derive tight upper bounds on the state complexity of binary operations that take arguments with different alphabets. We prove that the maximal syntactic semigroup of a non-returning language has $(n-1)^n$ elements and requires at least $\binom{n}{2}$ generators. We find the maximal state complexities of atoms of non-returning languages. Finally, we show that there exists a most complex non-returning language that meets the bounds for all these complexity measures.Comment: 22 pages, 6 figure

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages

A language $L$ over an alphabet $\Sigma$ is suffix-convex if, for any words $x,y,z\in\Sigma^*$, whenever $z$ and $xyz$ are in $L$, then so is $yz$. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free languages. We examine complexity properties of these three special classes of suffix-convex regular languages. In particular, we study the quotient/state complexity of boolean operations, product (concatenation), star, and reversal on these languages, as well as the size of their syntactic semigroups, and the quotient complexity of their atoms.Comment: 20 pages, 11 figures, 1 table. arXiv admin note: text overlap with arXiv:1605.0669

Information Security Protection System for Networked OT Environments of Industrial Control in Smart Manufacturing

This study develops an innovative information security protection system for end devices in smart manufacturing industrial control environments. By employing six key functionalities—lightweight identity authentication, traffic analysis, key management, personnel authorization control, system status monitoring, and an alarm mechanism—the system addresses the limitations of traditional firewalls. Experimental procedures involved testing the system against common threats, including phishing (fraud), physical intrusion, and Denial of Service attacks. Results demonstrate over 90% success in mitigating these attacks while maintaining operational efficiency. Furthermore, real-time monitoring and alert features enhance data protection and ensure reliable factory operations

Accretion of Planetary Material onto Host Stars

Accretion of planetary material onto host stars may occur throughout a star's life. Especially prone to accretion, extrasolar planets in short-period orbits, while relatively rare, constitute a significant fraction of the known population, and these planets are subject to dynamical and atmospheric influences that can drive significant mass loss. Theoretical models frame expectations regarding the rates and extent of this planetary accretion. For instance, tidal interactions between planets and stars may drive complete orbital decay during the main sequence. Many planets that survive their stars' main sequence lifetime will still be engulfed when the host stars become red giant stars. There is some observational evidence supporting these predictions, such as a dearth of close-in planets around fast stellar rotators, which is consistent with tidal spin-up and planet accretion. There remains no clear chemical evidence for pollution of the atmospheres of main sequence or red giant stars by planetary materials, but a wealth of evidence points to active accretion by white dwarfs. In this article, we review the current understanding of accretion of planetary material, from the pre- to the post-main sequence and beyond. The review begins with the astrophysical framework for that process and then considers accretion during various phases of a host star's life, during which the details of accretion vary, and the observational evidence for accretion during these phases.Comment: 18 pages, 5 figures (with some redacted), invited revie

Commutative positive varieties of languages

We study the commutative positive varieties of languages closed under various operations: Shuffle, renaming and product over one-letter alphabets

On the interplay between Babai and Černý’s conjectures

Motivated by the Babai conjecture and the Černý conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with n states in this class, we prove that the reset thresholds are upperbounded by 2n2 -6n + 5 and can attain the value (Formula presented). In addition, we study diameters of the pair digraphs of permutation automata and construct n-state permutation automata with diameter (formula presented). © Springer International Publishing AG 2017

Performance of CMS muon reconstruction in pp collision events at sqrt(s) = 7 TeV

The performance of muon reconstruction, identification, and triggering in CMS has been studied using 40 inverse picobarns of data collected in pp collisions at sqrt(s) = 7 TeV at the LHC in 2010. A few benchmark sets of selection criteria covering a wide range of physics analysis needs have been examined. For all considered selections, the efficiency to reconstruct and identify a muon with a transverse momentum pT larger than a few GeV is above 95% over the whole region of pseudorapidity covered by the CMS muon system, abs(eta) < 2.4, while the probability to misidentify a hadron as a muon is well below 1%. The efficiency to trigger on single muons with pT above a few GeV is higher than 90% over the full eta range, and typically substantially better. The overall momentum scale is measured to a precision of 0.2% with muons from Z decays. The transverse momentum resolution varies from 1% to 6% depending on pseudorapidity for muons with pT below 100 GeV and, using cosmic rays, it is shown to be better than 10% in the central region up to pT = 1 TeV. Observed distributions of all quantities are well reproduced by the Monte Carlo simulation.Comment: Replaced with published version. Added journal reference and DO

Organizational commitment, knowledge sharing and organizational citizenship behaviour: the case of the Taiwanese semiconductor industry

[[abstract]]The semiconductor industry has made great contributions to Taiwan’s economy in the past 20 years. Because of competitive salaries and generous fringe benefits, some famous semiconductor manufacturers have become the best choice for students right after graduation. However, such magnetic effect has gradually faded away in the face of implementation of expensive employee bonuses. In a changeable environment, sharing knowledge will maintain organizational competitiveness and improve employees’ cohesion. As the semiconductor industry is characterized by a low-wage and high-turnover rate, the incurred job insecurities and career uncertainties have begun to force employees to change their cohesion, loyalty to organizations and even to reduce their willingness to share knowledge with others. This study aims to explore the relationships among organizational commitment (OC), knowledge sharing (KS) and organizational citizenship behavior (OCB) in the Taiwanese semiconductor industry. On the basis of 428 subjects, the results show that KS has a partial mediating effect on the OC–OCB relationship.[[notice]]補正完畢[[journaltype]]國外[[incitationindex]]SSCI[[ispeerreviewed]]Y[[booktype]]紙本[[countrycodes]]GB

Performance of CMS muon reconstruction in pp collision events at sqrt(s) = 7 TeV

The performance of muon reconstruction, identification, and triggering in CMS has been studied using 40 inverse picobarns of data collected in pp collisions at sqrt(s) = 7 TeV at the LHC in 2010. A few benchmark sets of selection criteria covering a wide range of physics analysis needs have been examined. For all considered selections, the efficiency to reconstruct and identify a muon with a transverse momentum pT larger than a few GeV is above 95% over the whole region of pseudorapidity covered by the CMS muon system, abs(eta) < 2.4, while the probability to misidentify a hadron as a muon is well below 1%. The efficiency to trigger on single muons with pT above a few GeV is higher than 90% over the full eta range, and typically substantially better. The overall momentum scale is measured to a precision of 0.2% with muons from Z decays. The transverse momentum resolution varies from 1% to 6% depending on pseudorapidity for muons with pT below 100 GeV and, using cosmic rays, it is shown to be better than 10% in the central region up to pT = 1 TeV. Observed distributions of all quantities are well reproduced by the Monte Carlo simulation.Comment: Replaced with published version. Added journal reference and DO