We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
A new language and inference algorithm for stochastic modeling is presented. This work refines and generalizes the stochastic functional language originally proposed by [1]. The l...
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes that tile the plane by translation: a polyomino tiles the plane by translation...
Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laur...