Formal binary languages can represent graph classes by using their words as patterns to define edges, with languages such as palindromes and Dyck words able to describe all graphs or particular graph classes via suitable restrictions.
Journal of Automata, Lan- guages and Combinatorics13(1), 45–54 (2008)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Languages Describing Large Graph Classes
Formal binary languages can represent graph classes by using their words as patterns to define edges, with languages such as palindromes and Dyck words able to describe all graphs or particular graph classes via suitable restrictions.