Showing cs.LOShow all
2 papers · 1 filter
cs.LO2026
Width-Bounded Equational Derivations for Finite Graph Expressions
Antonios Kalampakas
Completeness of an equational presentation guarantees an equality path but need not control the resources used along it. For finite graph expressions we measure derivational space…
cs.LO2026
Automatic constraints with few subpowers and graphoid recognition
Antonios Kalampakas
Finite automata can describe relations of unbounded arity that are exponentially larger than their descriptions. We prove that constraint satisfaction for such relations is solvabl…