3 citations · 9 across the 23 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.LO2011★ 2 cited
Decision Problems for Recognizable Languages of Infinite Pictures
Olivier Finkel
Altenbernd, Thomas and Wöhrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acce…
cs.LO2011
Borel Hierarchy and Omega Context Free Languages
Olivier Finkel
We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994),…