The following pages link to (Q4989409):
Displaying 6 items.
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- Piecewise directable automata (Q2731278) (← links)
- (Q3484371) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)