Sylvie Davies

Available identifiers

zbMath Open davies.sylvieMaRDI QIDQ777985

List of research outcomes

Publication	Date of Publication	Type
Most complex deterministic union-free regular languages	2020-06-30	Paper
A new technique for reachability of states in concatenation automata	2020-06-30	Paper
State complexity of single-word pattern matching in regular languages	2020-05-12	Paper
Square, power, positive closure, and complementation on star-free languages	2020-05-12	Paper
Most Complex Non-Returning Regular Languages	2019-12-10	Paper
Primitivity, uniform minimality, and state complexity of Boolean operations	2019-09-05	Paper
State complexity of pattern matching in regular languages	2019-06-18	Paper
A general approach to state complexity of operations: formalization and limitations	2018-11-22	Paper
State complexity of reversals of deterministic finite automata with output	2018-11-07	Paper
Most complex non-returning regular languages	2017-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q2965987	2017-03-03	Paper
Quotient Complexities of Atoms in Regular Ideal Languages	2016-05-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sylvie Davies