✦ LIBER ✦

The basis automaton for the given regular language

✍ Scribed by Vakhitova, A. A.

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 120 KB
Volume: 6
Category: Article
ISSN: 1226-0061
DOI: 10.1007/bf03009953

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Possible edges of a finite automaton def

Possible edges of a finite automaton defining a given regular language

✍ Melnikov, B. F. ;Sciarini-Guryanova, N. V. 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 143 KB

LANGAGE: A maple package for automaton c

LANGAGE: A maple package for automaton characterization of regular languages

✍ Pascal Caron 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 95 KB

LANGAGE is a set of procedures for deciding whether or not a language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using

Some properties of the basis finite auto

Some properties of the basis finite automaton

✍ Melnikov, B. F. ;Melnikova, A. A. 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 164 KB

The representation of automatonic mappin

The representation of automatonic mappings by regular expressions

✍ M. A. Spivak 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 179 KB

Extension of the automaton specification

Extension of the automaton specification logical language and the synthesis problem

✍ A. N. Chebotarev 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 807 KB

The epistemological basis of religious l

The epistemological basis of religious language

✍ Patrick Foster 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 753 KB