✦ LIBER ✦

Determination of systems of graphs and the synthesis of finite automata

✍ Scribed by V. S. Grinberg

Book ID: 112450289
Publisher: SP MAIK Nauka/Interperiodica
Year: 1966
Tongue: English
Weight: 451 KB
Volume: 7
Category: Article
ISSN: 0037-4466
DOI: 10.1007/bf00966396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Determinization of Weighted Finit

On the Determinization of Weighted Finite Automata

✍ Buchsbaum, Adam L.; Giancarlo, Raffaele; Westbrook, Jeffery R. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 373 KB

The expansion of graphs and finite autom

The expansion of graphs and finite automata with respect to multiplication

✍ A. N. Melikhov; Yu. A. Dvoryantsev 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 566 KB

Shortest Paths in the Tower of Hanoi Gra

Shortest Paths in the Tower of Hanoi Graph and Finite Automata

✍ Romik, Dan 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 388 KB

Cooperating systems of four-dimensional

Cooperating systems of four-dimensional finite automata

✍ Yasuo Uchida; Takao Ito; Makoto Sakamoto; Kazuyuki Uchida; Takashi Ide; Ryoju Ka 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 279 KB

Synthesis of spectral densities using fi

Synthesis of spectral densities using finite automata

✍ Monti, C.M.; Pierobon, G.L.; Viaro, U. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 411 KB

Finite automata-models for the investiga

Finite automata-models for the investigation of dynamical systems

✍ Christian Schittenkopf; Gustavo Deco; Wilfried Brauer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 429 KB

We describe a method to measure the complexity of a dynamical system. By complexity we mean the intrinsic information processing abilities which we believe to be visible only on an infinitesimal scale. The complexity measure is based on concepts from information theory and from the theory of formal