State complexity of reversals of deterministic finite automata with output

DOI10.1007/978-3-319-94812-6_12OpenAlexW2617487162MaRDI QIDQ1616967

Sylvie Davies

Publication date: 7 November 2018

Full work available at URL: https://arxiv.org/abs/1705.07150

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: State complexity of reversals of deterministic finite automata with output