@ripe

New operations and regular expressions for two-dimensional languages over one-letter alphabet

, , and . Theoretical Computer Science, 340 (2): 408 - 431 (2005)The Art of Theory <xocs:full-name>The Art of Theory</xocs:full-name>.
DOI: 10.1016/j.tcs.2005.03.031

Abstract

We consider the problem of defining regular expressions to characterize the class of recognizable picture languages in the case of a one-letter alphabet. We define a diagonal concatenation and its star and consider two different families, L ( D ) and L ( \CRD\ ) , of languages denoted by regular expressions involving such operations plus classical operations. L ( D ) is characterized both in terms of rational relations and in terms of two-dimensional automata moving only right and down. L ( \CRD\ ) is included in \REC\ and contains languages defined by three-way automata while languages in L ( \CRD\ ) necessarily satisfy some regularity conditions. Finally, we introduce new definitions of advanced stars expressing the necessity of conceptually different definitions for iteration.

Links and resources

Tags

community

  • @ripe
  • @dblp
@ripe's tags highlighted