On completely reachable automata and subset reachability

DOI10.1007/978-3-319-98654-8_27OpenAlexW2801818712MaRDI QIDQ1622980

François Gonze, Raphaël M. Jungers

Publication date: 22 November 2018

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Preimage problems for deterministic finite automata

This page was built for publication: On completely reachable automata and subset reachability