Pages that link to "Item:Q1956627"
From MaRDI portal
The following pages link to Finite transducers and nondeterministic state complexity of regular languages (Q1956627):
Displaying 8 items.
- Finite state transducers with predicates and identities (Q700795) (← links)
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\). (Q1853563) (← links)
- Finite State Transducers with Intuition (Q3575214) (← links)
- (Q4036600) (← links)
- (Q4412574) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Complexity of injection structures induced by finite state transducers (Q5872864) (← links)
- (Q6070604) (← links)
