DOIAbstract
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms
Graph transformation languages are declarative, rule-based languages that abstract from low-level re...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
One concern in making the calculation of algorithms a formal mathematical activity is succinctness o...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of som...
AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an examp...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Formal methods are scarcely used in industrial applications. Industrial strength tools and education...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
Abstract: We investigate sequential derivation languages associated with graph grammars, as a loose ...
A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algor...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
In natural language processing (NLP) there is an increasing interest in formal models for processing...
Graph transformation languages are declarative, rule-based languages that abstract from low-level re...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
One concern in making the calculation of algorithms a formal mathematical activity is succinctness o...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
AbstractWe illustrate the use of formal languages and relations in compact formal derivations of som...
AbstractWe survey an algebra of formal languages suitable to deal with graph algorithms. As an examp...
Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete la...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
Formal methods are scarcely used in industrial applications. Industrial strength tools and education...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algori...
Abstract: We investigate sequential derivation languages associated with graph grammars, as a loose ...
A calculational derivation is given of two abstract path algorithms. The first is an all-pairs algor...
AbstractA calculational derivation is given of two abstract path algorithms. The first is an all-pai...
In natural language processing (NLP) there is an increasing interest in formal models for processing...
Graph transformation languages are declarative, rule-based languages that abstract from low-level re...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
One concern in making the calculation of algorithms a formal mathematical activity is succinctness o...
Add to ORKG