Christian Lindorfer

collaborators

3 papers

cs.FL2020

Comparing consecutive letter counts in multiple context-free languages

Florian Lehner, Christian Lindorfer

Context-free grammars are not able to model cross-serial dependencies in natural languages. To overcome this issue, Seki et al. introduced a generalization called $m$ -multiple cont…

math.CO2019

The language of self-avoiding walks

Christian Lindorfer, Wolfgang Woess

Let $X = (V X, E X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E X$ is equipped with an involution…

math.CO2019

A general bridge theorem for self-avoiding walks

Christian Lindorfer

Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, a…