A complete refinement procedure for regular separability of context-free languages

Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present a class of semi-decision procedures for regular separability of context-free languages, based on counter-example guided abstraction refinement. We prop...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2016-04, Vol.625, p.1-24
Hauptverfasser:	Gange, Graeme, Navas, Jorge A., Schachte, Peter, Søndergaard, Harald, Stuckey, Peter J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Abstraction refinement Completeness Computer simulation Context free languages Languages Mathematical models Regular approximation Separability Sound
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!