✦ LIBER ✦

The representation of automatonic mappings by regular expressions

✍ Scribed by M. A. Spivak

Publisher: Springer US
Year: 1965
Tongue: English
Weight: 179 KB
Volume: 1
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074691

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iteration of maps by an automaton

✍ F.M. Dekking 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Let x=(x1, x2,. .) with the xi elements of a finite set A be an automatic sequence, i.e., x is generated by a tag machine with deletion number one. Let F be a finite set and suppose maps rp,: F+F are given for all aEA. It is shown constructively that the sequence of iterates (cp,,, cpx,ocpxl, cpx,"c

Representation of fuzzy-valued mappings

Representation of fuzzy-valued mappings by the sequence of single-valued mappings

✍ Mila Stojaković 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 413 KB

In this paper the analysis focusses on the important classes of fuzzy-valued mappings: -measurable fuzzy-valued mappings, -integrable fuzzy-valued mappings. Our aim is to discuss the problem of representation of such mappings by countable family of single-valued mappings. This is a most useful resu

The representation of regular functions

The representation of regular functions by Dirichlet series

✍ Yu. I. Mel'nik 📂 Article 📅 1977 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 384 KB

The different and discriminant of regula

The different and discriminant of regular mappings

✍ I. V. Dolgachev; A. N. Parshin 📂 Article 📅 1968 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 178 KB

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

Describing non-deterministic reactive sy

Describing non-deterministic reactive systems by means of regular expressions

✍ Pascal Raymond; Yvan Roux 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 445 KB

This paper presents a language based on regular expressions for describing nondeterministic reactive systems. It also presents some ideas on how to build (or adapt) tools for exploiting such a language (recognizers, generators and provers).