𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Description and implementation of languages defining finite relations

✍ Scribed by V. Yu. Mikhailov; P. V. Pshenichnyi; R. R. Tagirov

Publisher
Springer US
Year
1989
Tongue
English
Weight
390 KB
Volume
45
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient implementation of regular lang
Efficient implementation of regular languages using reversed alternating finite automata
✍ K. Salomaa; X. Wu; S. Yu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 93 KB

Alternating ΓΏnite automata (AFA) provide a natural and succinct way to denote regular languages. We introduce a bit-wise representation of reversed AFA (r-AFA) transition functions and describe an e cient implementation method for r-AFA and their operations using this representation. Experiments hav

Constructing a Short Defining Set of Rel
Constructing a Short Defining Set of Relations for a Finite Group
✍ Volker Gebhardt πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 142 KB

An algorithm for the construction of a defining set of relations w.r.t. a given set of generators of a finite group G is presented. Compared with previously known methods it yields fewer relations and is better suited for iterated application to large groups. These improvements are achieved by consi