3 papers
math.CO2025
Word-Representable Graphs and Locality of Words
Philipp Böll, Pamela Fleischmann, Annika Huch +4
In this work, we investigate the relationship between -repre\-sentable graphs and graphs representable by -local words. In particular, we show that every graph representable…
cs.FL2024
The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
Dirk Nowotka, Max Wiedenhöft
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only termina…
cs.FL2024
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
Dirk Nowotka, Max Wiedenhöft
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only termina…