Titlebook: Descriptional Complexity of Formal Systems; 24th IFIP WG 1.02 In Yo-Sub Han,Gy?rgy Vaszil Conference proceedings 2022 IFIP International Fe

描繪

Fulsome

Yet Another Canonical Nondeterministic Automaton,omaton (DFA), the canonical residual finite state automaton (RFSA), and the átomaton of a language, then the átomaton can be seen as the dual automaton of the minimal DFA, but no such dual has been presented for the canonical RFSA so far. We fill this gap by introducing a new canonical automaton tha

burnish

解脫

https://doi.org/10.1007/978-3-031-13257-5artificial intelligence; automata; automata theory; automation; computational linguistics; computer syste

加強(qiáng)防衛(wèi)

978-3-031-13256-8IFIP International Federation for Information Processing 2022

LINES

gastritis

強(qiáng)所

https://doi.org/10.1007/978-94-007-5974-9ds allows to address words directly and not through some integer encoding (of exponential size). Considering alphabets with at least two symbols allows to relate simply and naturally to complexity theory. Indeed, the polynomial-time complexity class (as well as . and exponential time) corresponds to

有害處

客觀

https://doi.org/10.1007/978-94-007-5974-9 of scattered factors (also known as subwords or subsequences), which are parts of the word in the correct order but not necessarily consecutive, e.g., . is a scattered factor of . but . is not. Following the idea of scattered factor .-universality (also known as .-richness), we investigate nearly .