Pages that link to "Item:Q1173410"
From MaRDI portal
The following pages link to On the finite-valuedness problem for sequential machines (Q1173410):
Displaying 12 items.
- On the topological structure of a finitely generated semigroup of matrices (Q1103733) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)
- On finitely generated monoids of matrices with entries in $\mathbb {N}$ (Q5752758) (← links)