Publication:4449534
From MaRDI portal
zbMath1089.68049MaRDI QIDQ4449534
Publication date: 11 February 2004
68W05: Nonnumerical algorithms
68R15: Combinatorics on words
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
68Q70: Algebraic theory of languages and automata
Related Items
Unnamed Item, Crisp-determinization of weighted tree automata over strong bimonoids, A Pattern Logic for Automata with Outputs, Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels, Bideterministic weighted automata, Bideterministic weighted automata, Rigorous approximated determinization of weighted automata, Determinization of fuzzy automata via factorization of fuzzy states, An optimal pre-determinization algorithm for weighted transducers, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, Algorithmic aspects of a general modular decomposition theory, Transducer descriptions of DNA code properties and undecidability of antimorphic problems, Efficient algorithms for computing the inner edit distance of a regular language via transducers, On deterministic weighted automata, Finite sequentiality of unambiguous max-plus tree automata, Determinisability of unary weighted automata over the rational numbers, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, A disambiguation algorithm for weighted automata, Sequential?, A Disambiguation Algorithm for Finite Automata and Functional Transducers, On the Disambiguation of Weighted Automata, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
