Titlebook: Implementation and Application of Automata; 19th International C Markus Holzer,Martin Kutrib Conference proceedings 2014 Springer Internati

有機(jī)體

Surgeon

Minimal Partial Languages and Automatag full languages. Our paper focuses on algorithms for the construction of minimal partial languages, associated with some ?-substitution, as well as approximation algorithms for the construction of minimal ?-DFAs.

手段

亞麻制品

Trochlea

A Type System for Weighted Automata and Rational Expressionsf a static type system for automata. Between such a low-level layer and the interactive high-level interface, the type system plays the crucial role of a mediator and allows for a cleanly-structured use of dynamic compilation.

小隔間

outskirts

Cholesterol

On the Square of Regular Languages is hard for the square operation on languages accepted by alternating finite automata. In the unary case, the known upper bound for square is 2.???1, and we prove that each value in the range from 1 to 2.???1 may be attained by the state complexity of the square of a unary language with state complexity . whenever .?≥?5.

薄荷醇

Recognition of Labeled Multidigraphs by Spanning Tree Automataled multidigraphs for a spanning tree automaton is NP-complete because the Hamiltonian path problem can be easily reduced to it. However, it will be shown that the membership problem is solvable in linear time for graphs of bounded tree-width.

extinguish

Counting Equivalent Linear Finite Transducers Using a Canonical Formprove that every LFT has exactly one equivalent canonical LFT. We then show how this canonical LFT allows us to calculate the size of each equivalence class on the set of the LFTs with the same number of states.