Sylvie Davies

From MaRDI portal
Person:777985

Available identifiers

zbMath Open davies.sylvieMaRDI QIDQ777985

List of research outcomes





PublicationDate of PublicationType
Most complex deterministic union-free regular languages2020-06-30Paper
A new technique for reachability of states in concatenation automata2020-06-30Paper
Square, power, positive closure, and complementation on star-free languages2020-05-12Paper
State complexity of single-word pattern matching in regular languages2020-05-12Paper
Most Complex Non-Returning Regular Languages2019-12-10Paper
Primitivity, uniform minimality, and state complexity of Boolean operations2019-09-05Paper
State complexity of pattern matching in regular languages2019-06-18Paper
A general approach to state complexity of operations: formalization and limitations2018-11-22Paper
State complexity of reversals of deterministic finite automata with output2018-11-07Paper
Most complex non-returning regular languages2017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q29659872017-03-03Paper
Quotient complexities of atoms in regular ideal languages2016-05-03Paper

Research outcomes over time

This page was built for person: Sylvie Davies

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:777985&oldid=7204606"
Powered by MediaWiki