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...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 387 - 396
Main Authors:	Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 05.07.2016
Series:	ACM Conferences
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!