Titlebook: Language and Automata Theory and Applications; 15th International C Alberto Leporati,Carlos Martín-Vide,Claudio Zandro Conference proceedin

他一致

On the Computational Power of Programs over , Monoidnfirmed (Tesson-Therien (2001)) for the case of groups and several subclasses of aperiodic monoids such as the variety . and the monoids divided by the monoid .. However, the case of the set of monoids divided by the monoid . is still open, which if resolved, confirms the conjecture for all aperiodi

熄灭

Location Based Automata for Expressions with Shufflellow for the definition of the sets ., . and . with their usual semantics. From these, we construct an automaton for regular expressions with shuffle (.), which generalises the standard position/Glushkov automaton. The sets mentioned above are also the foundation for other constructions, such as the

climax

Yourself

Classify

On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automatastate two-way deterministic finite automaton (2DFA). It is proved that a 2DFA with . states can be transformed to a UFA with fewer than . states. On the other hand, for every ., there is a language recognized by an .-state 2DFA that requires a UFA with at least . states. The latter result is proved

结果

Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars israph of small connected components. To get large connected hypergraphs, they can be copied multiple times and can be fused by the application of fusion rules. In this paper, we analyze the non-emptiness problem for connection-preserving fusion grammars and show that this is an NP complete problem. W

人工制品

interior

On Hardest Languages for One-Dimensional Cellular Automatans has been investigated for quite a few language families. This paper shows that for one-way real-time cellular automata, also known as trellis automata, there is no hardest language, whereas for linear-time cellular automata, the hardest language is constructed.

IVORY

Usefulness of Information and Unary Languagesroblem (see Rovan and Sádovský [.] for an overview). We use deterministic finite automata for a formal setting. Given a problem (a regular language) . we measure the complexity of its solution – a DFA . such that . – using the state complexity. A supplementary information (advice) . given by . is us

Grating