Impugn
发表于 2025-3-25 03:48:58
Simulation Relations for Alternating Parity Automata and Parity Gamesshow quotienting does preserve the language recognized. We propose a heuristic for reducing the size of alternating parity automata and parity games and, as an evidence for its usefulness, demonstrate that it is successful when applied to the Jurdziński family of parity games.
BAN
发表于 2025-3-25 09:05:13
http://reply.papertrans.cn/28/2703/270237/270237_22.png
Regurgitation
发表于 2025-3-25 14:21:31
Erkrankungen des MakrophagensystemsA transductions. Perhaps the most important aspect of this work consists in defining nondeterministic bimachines and describing their power by linking them with weakly ambiguous finite transducers (IU and FA).
带来
发表于 2025-3-25 19:12:46
https://doi.org/10.1007/978-3-642-70908-1form, we propose an . algorithm for parsing that applies to any such normalized boolean grammar. In summary, the main contribution of this paper is to provide a semantics which applies to . boolean grammars while at the same time retaining the complexity of parsing associated with this type of grammars.
使更活跃
发表于 2025-3-25 23:35:35
http://reply.papertrans.cn/28/2703/270237/270237_25.png
青少年
发表于 2025-3-26 03:30:40
On Weakly Ambiguous Finite TransducersA transductions. Perhaps the most important aspect of this work consists in defining nondeterministic bimachines and describing their power by linking them with weakly ambiguous finite transducers (IU and FA).
高度赞扬
发表于 2025-3-26 07:47:18
Well-Founded Semantics for Boolean Grammarsform, we propose an . algorithm for parsing that applies to any such normalized boolean grammar. In summary, the main contribution of this paper is to provide a semantics which applies to . boolean grammars while at the same time retaining the complexity of parsing associated with this type of grammars.
Pulmonary-Veins
发表于 2025-3-26 08:51:00
On the Gap-Complexity of Simple RL-Automata. Here we study the . of these automata. The membership problem for a language that is accepted by a .-.-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, .-.-automata with an unbounded number of gaps accept .-complete languages.
谷类
发表于 2025-3-26 15:36:37
http://reply.papertrans.cn/28/2703/270237/270237_29.png
节省
发表于 2025-3-26 19:21:56
Context-Free Grammars and XML Languagesable; while establishing whether its surfaces are regular turns out to be undecidable whenever the deterministic language is contained in the Dyck language with two pairs of parentheses. Our results are based on a “pumping property” of what Boasson and Berstel call the surface of a context-free language.