Pages that link to "Item:Q5131102"
From MaRDI portal
The following pages link to Language acceptability of finite automata based on theory of semi‐tensor product of matrices (Q5131102):
Displaying 5 items.
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition (Q1633055) (← links)
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata (Q2849913) (← links)
- (Q4364599) (← links)
- Matrix approach to I-detectability of partially observed discrete event systems (Q6578823) (← links)
- A new look at the critical observability of finite state machines from an algebraic viewpoint (Q6579017) (← links)