The following pages link to (Q3123631):
Displaying 17 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Semigroup theory of symmetry (Q338184) (← links)
- On the word problem for syntactic monoids of piecewise testable languages. (Q444643) (← links)
- Piecewise testable languages via combinatorics on words (Q641179) (← links)
- Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (Q1123986) (← links)
- Polynomial closure and unambiguous product (Q1361889) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- Hierarchies of Piecewise Testable Languages (Q3533034) (← links)
- A Robust Class of Regular Languages (Q3599114) (← links)
- (Q4407440) (← links)
- (Q4580330) (← links)
- (Q4934333) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)
- Automata, Languages and Programming (Q5716794) (← links)