𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic Constraints, Automata, and Regular Languages

✍ Scribed by Bakhadyr Khoussainov

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
840 KB
Volume
31
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Succinct representation of regular langu
Succinct representation of regular languages by boolean automata
✍ Ernst Leiss πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 346 KB

Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B

On algebraic and logical specifications
On algebraic and logical specifications of classes of regular languages
✍ Bakhadyr Khoussainov πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 231 KB

The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to speciΓΏcations of these classes from algebraic, computational and logical points of view.

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