Titlebook: Developments in Language Theory; 24th International C Nata?a Jonoska,Dmytro Savchuk Conference proceedings 2020 Springer Nature Switzerland

愛國者

輕率看法

Die Wohnungseigentümer als Schuldnerality. After a series of preliminary combinatorial results, we present an algorithm computing, for a given .-universal word . the minimal . such that . is .-universal for some .. Several other connected problems are also considered.

耕種

,Schule als Fall – Zur Einführung,ords. We give a matching lower bound that holds even if .(.) is represented as an NFA. We then show that the same upper and lower bounds hold for an unambiguous finite-state transducer that computes .-successors.

最高峰

瑣碎

Strength

The State Complexity of Lexicographically Smallest Words and Computing Successors,ords. We give a matching lower bound that holds even if .(.) is represented as an NFA. We then show that the same upper and lower bounds hold for an unambiguous finite-state transducer that computes .-successors.

協(xié)議

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata,der ACA (DACA) as a candidate for a decider counterpart to (acceptor) ACAs. We show the class of languages decidable in constant time by DACAs equals the locally testable languages, and we also determine . as the (tight) time complexity threshold for DACAs up?to which no advantage compared to constant time is possible.

壕溝

On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection,would imply the existence of deterministic sub-exponential time algorithms for the simulation of nondeterministic linear space bounded computations. This consequence strengthens the existing conditional lower bounds for .-DFA-NEI and implies new non-uniform circuit lower bounds.

微枝末節(jié)

MANIA

On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations,how they are built: one can ensure, for instance, that there are no two consecutive stars in regular expressions. This generalizes a former result where only one equation was allowed, confirming the lack of expressivity of uniform random expressions.