LAIR
发表于 2025-3-26 22:09:53
0302-9743 cal Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Progr
accessory
发表于 2025-3-27 02:03:05
http://reply.papertrans.cn/63/6262/626149/626149_32.png
发微光
发表于 2025-3-27 06:14:47
Universal Lyndon Wordsticular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us to give an algorithm for constructing all the universal Lyndon words.
incisive
发表于 2025-3-27 12:38:16
Classifying Recognizable Infinitary Trace Languages Using Word Automatas of all recognizable .-trace languages in terms of Muller (word) automata. Finally, we show that the linearization of any recognizable .-trace language can be expressed as a Boolean combination of languages recognized by our class of deterministic Büchi automata.
Soliloquy
发表于 2025-3-27 17:28:31
http://reply.papertrans.cn/63/6262/626149/626149_35.png
无关紧要
发表于 2025-3-27 21:00:18
0302-9743 amming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.978-3-662-44521-1978-3-662-44522-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
Unsaturated-Fat
发表于 2025-3-28 00:27:51
Random Deterministic Automataost recent advances, such as the average running time of Moore’s state minimization algorithm or the estimation of the probability that an automaton is minimal. While focusing on results, we also try to give an idea of the main tools used in this field.
Preserve
发表于 2025-3-28 03:18:03
http://reply.papertrans.cn/63/6262/626149/626149_38.png
defendant
发表于 2025-3-28 10:18:03
An Algebraic Characterization of Unary Two-Way Transducersar case where the input and output alphabets are both unary but when the transducer is not necessarily deterministic. This yields a family which extends properly the rational relations in a very natural manner. We show that deterministic two-way unary transducers are no more powerful than one-way transducers.
大看台
发表于 2025-3-28 13:17:48
http://reply.papertrans.cn/63/6262/626149/626149_40.png