First-order definability of rational transductions An algebraic approach

The algebraic theory of rational languages has provided powerful decidability results. Among them, one of the most fundamental is the definability of a rational language in the class of aperiodic languages, i.e., languages recognized by finite automata whose transition relation defines an aperiodic...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science S. 387 - 396
Hauptverfasser:	Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 05.07.2016
Schriftenreihe:	ACM Conferences
Schlagworte:	Theory of computation > Formal languages and automata theory > Formalisms > Rewrite systems Theory of computation > Formal languages and automata theory > Grammars and context-free languages rational word transductions definability problems algebraic characterizations first-order logic
ISBN:	9781450343916, 1450343910
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!