The complexity of concatenation on deterministic and alternating finite automata

Michal Hospodár, Galina Jirásková. The complexity of concatenation on deterministic and alternating finite automata. ITA, 52(2-3-4):153-168, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.