Pages that link to "Item:Q1575676"
From MaRDI portal
The following pages link to Minimization algorithms for sequential transducers (Q1575676):
Displaying 31 items.
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Translating regular expression matching into transducers (Q420836) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Pattern expressions and pattern automata (Q834961) (← links)
- Weighted finite automata over strong bimonoids (Q845343) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Minimizing deterministic weighted tree automata (Q1041045) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- Deterministic generalized automata (Q1285583) (← links)
- A proof of Choffrut's theorem on subsequential functions (Q1285595) (← links)
- Finite-state transducer cascades to extract named entities in texts. (Q1426164) (← links)
- Minimization algorithms for sequential transducers (Q1575676) (← links)
- Pseudo-minimal transducer (Q1575902) (← links)
- The design principles of a weighted finite-state transducer library (Q1575905) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- Minimizing subsequential transducers: a survey. (Q1853736) (← links)
- Conditions for the existence of maximal factorizations (Q2035282) (← links)
- Computing the prefix of an automaton (Q2729627) (← links)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS (Q2929640) (← links)
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (Q3503890) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- Minimizing Deterministic Weighted Tree Automata (Q3540127) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- Using Ranked Semirings for Representing Morphology Automata (Q5188609) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)
- COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN (Q5704369) (← links)
- Largest common prefix of a regular tree language (Q5919000) (← links)
