The following pages link to (Q4219027):
Displaying 23 items.
- Finite automata encoding geometric figures (Q995557) (← links)
- A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Fractional parts of dense additive subgroups of real numbers (Q1630856) (← links)
- Interpreting the monadic second order theory of one successor in expansions of the real line (Q1650004) (← links)
- How to avoid a compact set (Q2014009) (← links)
- A tetrachotomy for expansions of the real ordered additive group (Q2037136) (← links)
- Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) (← links)
- When is scalar multiplication decidable? (Q2311210) (← links)
- An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) (← links)
- (Q3362714) (← links)
- Convex Hull of Arithmetic Automata (Q3522060) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- (Q5009704) (← links)
- (Q5020521) (← links)
- (Q5155673) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- (Q5216311) (← links)
- Computer Aided Verification (Q5312910) (← links)
- A Generalization of Cobham’s Theorem to Automata over Real Numbers (Q5428861) (← links)
- Decidability of Definability Issues in the Theory of Real Addition (Q5880942) (← links)
- Fractals and the monadic second order theory of one successor (Q6091636) (← links)
- Fractal dimensions of \(k\)-automatic sets (Q6642880) (← links)
