On Weakly Ambiguous Finite Transducers

On weakly $mathfrak{F}_{s}$-quasinormal subgroups of finite groups

Let $mathfrak{F}$ be a formation and $G$ a finite group. A subgroup $H$ of $G$ is said to be weakly $mathfrak{F}_{s}$-quasinormal in $G$ if $G$ has an $S$-quasinormal subgroup $T$ such that $HT$ is $S$-quasinormal in $G$ and $(Hcap T)H_{G}/H_{G}leq Z_{mathfrak{F}}(G/H_{G})$, where $Z_{mathfrak{F}}(G/H_{G})$ denotes the $mathfrak{F}$-hypercenter of $G/H_{G}$. In this paper, we study the structur...

On Weakly Co-Hopfian Modules

General Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers

We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ǫ-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A| E ), and finite or polynomial ambiguity in time O(|A| E ), where |A|E denotes the number of transitions of A. These complexities significantly improve over the previous best...

Extraction of ε-Cycles from Finite-State Transducers

Much attention has been brought to determinization and ε-removal in previous work. This article describes an algorithm for extracting all ε-cycles, which are a special type of non-determinism, from an arbitrary finite-state transducer (FST). The algorithm factorizes (decomposes) the FST, T , into two FSTs, T1 and T2, such that T1 contains no ε-cycles and T2 contains all ε-cycles of T . Since ε-...

Morphological Disambiguation and Text Normalization for Southern Quechua Varieties

We built a pipeline to normalize Quechua texts through morphological analysis and disambiguation. Word forms are analyzed by a set of cascaded finite state transducers which split the words and rewrite the morphemes to a normalized form. However, some of these morphemes, or rather morpheme combinations, are ambiguous, which may affect the normalization. For this reason, we disambiguate the morp...