SD-Regular Transducer Expressions for Aperiodic Transformations

FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In this paper, we solve the problem of expressions capturing first order definable functions, thereby generalizing the semin...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori:	Dartois, Luc, Gastin, Paul, Krishna, Shankara Narayanan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 29.06.2021
Predmet:	Complexity theory Computer science Delays Synchronization Time complexity Transducers
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!