scientific article; zbMATH DE number 2040319
From MaRDI portal
Publication:4449534
zbMath1089.68049MaRDI QIDQ4449534
Publication date: 11 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items (23)
Crisp-determinization of weighted tree automata over strong bimonoids ⋮ A Disambiguation Algorithm for Finite Automata and Functional Transducers ⋮ Rigorous approximated determinization of weighted automata ⋮ On the Disambiguation of Weighted Automata ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers ⋮ 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 ⋮ Sequential? ⋮ Unnamed Item ⋮ On deterministic weighted automata ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring ⋮ A Pattern Logic for Automata with Outputs ⋮ Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels ⋮ A disambiguation algorithm for weighted automata
This page was built for publication:
