Titlebook: Implementation and Application of Automata; 15th International C Michael Domaratzki,Kai Salomaa Conference proceedings 2011 Springer Berlin

外星人

Partial Derivative Automata Formalized in ,,In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the . proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in . towards their usage in program certification.

airborne

Regular Geometrical Languages and Tiling the Plane,We show that if a binary language . is regular, prolongable and geometrical, then it can generate, on certain assumptions, a .1 type tiling of a part of ℕ.. We also show that the sequence of states that appear along a horizontal line in such a tiling only depends on the shape of the tiling sub-figure and is somehow periodic.

星球的光亮度

bypass

Norbert Hundeshagen,Friedrich Otto,Marcel Vollweilerh neighboring nwnbers of atoms. The difference between clusters and small particles is such that parameters of small particles are monotonic functions of the nw978-1-4612-7082-9978-1-4612-1294-2Series ISSN 0938-037X

等待

From Sequential Extended Regular Expressions to NFA with Symbolic Labels, been implemented in the . library, with Binary Decision Diagrams (BDD) used to represent transition labels..We carried out a thorough experimental evaluation over a set of realistic benchmarks, comparing our library against . (which uses deterministic finite automata with BDD-based symbolic transit