Sylvie Davies

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Most complex deterministic union-free regular languages (available as arXiv preprint)	2020-06-30	Paper
A new technique for reachability of states in concatenation automata (available as arXiv preprint)	2020-06-30	Paper
Square, power, positive closure, and complementation on star-free languages	2020-05-12	Paper
State complexity of single-word pattern matching in regular languages	2020-05-12	Paper
Most complex non-returning regular languages International Journal of Foundations of Computer Science	2019-12-10	Paper
Primitivity, uniform minimality, and state complexity of Boolean operations Theory of Computing Systems	2019-09-05	Paper
State complexity of pattern matching in regular languages Theoretical Computer Science	2019-06-18	Paper
A general approach to state complexity of operations: formalization and limitations (available as arXiv preprint)	2018-11-22	Paper
State complexity of reversals of deterministic finite automata with output (available as arXiv preprint)	2018-11-07	Paper
Most complex non-returning regular languages (available as arXiv preprint)	2017-08-31	Paper
Most complex regular ideal languages (available as arXiv preprint)	2017-03-03	Paper
Most complex regular ideal languages	2017-03-03	Paper
Quotient complexities of atoms in regular ideal languages Acta Cybernetica	2016-05-03	Paper

Research outcomes over time

This page was built for person: Sylvie Davies