Bounded Fixed-Point Definability and Tabular Recognition of Languages

Hans Leiß. Bounded Fixed-Point Definability and Tabular Recognition of Languages. In Hans Kleine Büning, editor, Computer Science Logic, 9th International Workshop, CSL 95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers. Volume 1092 of Lecture Notes in Computer Science, pages 388-402, Springer, 1995.

Abstract

Abstract is missing.