๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fans Generated by Nondeterministic Automata

โœ Scribed by Dirk van Dalen

Publisher
John Wiley and Sons
Year
1968
Tongue
English
Weight
375 KB
Volume
14
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Automaticity of double sequences generat
Automaticity of double sequences generated by one-dimensional linear cellular automata
โœ J.-P Allouche; F von Haeseler; H.-O Peitgen; A Petersen; G Skordev ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 991 KB

We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.

Logical Complexity of Some Classes of Tr
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata
โœ Wojciech Buszkowski ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ