Titlebook: Developments in Language Theory; 10th International C Oscar H. Ibarra,Zhe Dang Conference proceedings 2006 Springer-Verlag Berlin Heidelber

Impugn

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

Regurgitation

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).

帶來

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.

使更活躍

青少年

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).

高度贊揚(yáng)

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

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.

谷類

節(jié)省

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.