Titlebook: Language and Automata Theory and Applications; 13th International C Carlos Martín-Vide,Alexander Okhotin,Dana Shapira Conference proceeding

多节

Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automataucers. Due to this translation we obtain a simple procedure for checking equivalence of 2-DFSAs in polynomial time. We believe that the further development of this approach could bring us to an efficient equivalence checking algorithm for deterministic multi-tape automata with an arbitrary number of tapes.

天空

ingrate

Delectable

Pericarditis

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/581020.jpg

到婚嫁年龄

978-3-030-13434-1Springer Nature Switzerland AG 2019

JIBE

Language and Automata Theory and Applications978-3-030-13435-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

irradicable

From Words to Graphs, and Backe discovery of the Prüfer code for trees, the interplay between words and graphs has repeatedly been explored and exploited in both directions. In the present paper, we review some of the many results in this area and discuss a number of open problems related to this topic.

Favorable

subordinate

Modern Aspects of Complexity Within Formal LanguagesWe give a survey on some recent developments and achievements of modern complexity-theoretic investigations of questions in Formal Languages (FL). We will put a certain focus on multivariate complexity analysis, because this seems to be particularly suited for questions concerning typical questions in FL.