The following pages link to (Q4281563):
Displayed 9 items.
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
- Level two of the quantifier alternation hierarchy over infinite words (Q1635804) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Refuting learning revisited. (Q1874232) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- Level Two of the Quantifier Alternation Hierarchy over Infinite Words (Q5740188) (← links)