There’s an old puzzle that requires the solver to form as many whole numbers as possible, starting with 1, using only the digit 4 exactly four times, together with ordinary arithmetic and algebraic ...

ω-automata is a variant of finite automata which accepts infinite strings. It represents the behaviour of the infinite systems (hardware, operating system and control systems) which are not expected ...

The universe is cellular automaton in which reality is simply the readout of a giant, fantastically complex computing machine. That’s the conclusion of Nobel Prize-winning physicist Gerard ‘t Hooft, ...

Automata learning and formal verification represent converging fields aimed at enhancing the reliability and safety of complex systems. Automata learning involves the algorithmic inference of system ...

This paper develops a formalism within which the application of dynamic programming to discrete, deterministic problems is rigorously studied. The two central concepts underlying this development are ...