Pages that link to "Item:Q1177168"
From MaRDI portal
The following pages link to On the degree of ambiguity of finite automata (Q1177168):
Displaying 47 items.
- Ambiguity and communication (Q537915) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Probabilistic automata of bounded ambiguity (Q2064517) (← links)
- Max-plus automata (Q2074207) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- Width measures of alternating finite automata (Q2096586) (← links)
- Image-binary automata (Q2096597) (← links)
- Finite ambiguity and finite sequentiality in weighted automata over fields (Q2097226) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
- Memoized regular expressions (Q2117661) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Sequential? (Q2490822) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
- Width of Non-deterministic Automata (Q3304146) (← links)
- Distance automata having large finite distance or finite ambiguity (Q4032930) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- (Q5002806) (← links)
- (Q5079737) (← links)
- Register Transducers Are Marble Transducers (Q5089194) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- (Q5090506) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- (Q5092440) (← links)
- Probabilistic Automata of Bounded Ambiguity (Q5111632) (← links)
- (Q5155668) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- On finitely generated monoids of matrices with entries in $\mathbb {N}$ (Q5752758) (← links)
- Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Polynomially ambiguous unary weighted automata over fields (Q6038711) (← links)
- Finitely ambiguous and finitely sequential weighted automata over fields (Q6593669) (← links)
- Finite sequentiality of finitely ambiguous max-plus tree automata (Q6614608) (← links)
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals (Q6649444) (← links)
