Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

DOI10.1145/2837614.2837647MaRDI QIDQ2828274zbMATH OpenOpenAlexFDO

Authors Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen, Kristoffer Aalund Søholm, Sebastian Paaske Tørholm

Publication date 24 October 2016

Published in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2837614.2837647

zbMATH Keywords

automatondeterminizationstreamingregular expressionnondeterministic transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Recommendations

• Nondeterministic Streaming String Transducers
• Expressiveness of streaming string transducers
• Optimally streaming greedy regular expression parsing
• scientific article; zbMATH DE number 1045406
• scientific article; zbMATH DE number 1962764

This page was built for publication: Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828274)