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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 387 - 396
Hlavní autori:	Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 05.07.2016
Edícia:	ACM Conferences
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!