Periodicity in generations of automata
From MaRDI portal
Publication:4047534
DOI10.1007/BF01761704zbMath0295.02019OpenAlexW2041249678WikidataQ56656242 ScholiaQ56656242MaRDI QIDQ4047534
Publication date: 1974
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01761704
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) General biology and biomathematics (92B05) Turing machines and related notions (03D10)
Related Items
On learning of functions refutably. ⋮ A solution to Wiehagen's thesis ⋮ Robust learning -- rich and poor ⋮ Learnability: Admissible, co-finite, and hypersimple languages ⋮ Learning in the presence of inaccurate information ⋮ Effectivity questions for Kleene's recursion theorem ⋮ A map of update constraints in inductive inference ⋮ Parsimony hierarchies for inductive inference ⋮ UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ Infinitary self-reference in learning theory ⋮ On aggregating teams of learning machines ⋮ On the power of recursive optimizers ⋮ Machine learning of higher-order programs ⋮ Learning-theoretic perspectives of acceptable numberings ⋮ From Turing machines to computer viruses ⋮ Computability-theoretic learning complexity ⋮ Learning and classifying ⋮ Iterative learning from positive data and counters ⋮ Kolmogorov numberings and minimal identification ⋮ Learning secrets interactively. Dynamic modeling in inductive inference ⋮ Reflecting and self-confident inductive inference machines ⋮ Jumps of computably enumerable equivalence relations ⋮ Iterative learning from texts and counterexamples using additional information ⋮ The independence of control structures in abstract programming systems ⋮ Parallelism Increases Iterative Learning Power ⋮ THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Dynamic Modeling in Inductive Inference ⋮ On a question about learning nearly minimal programs ⋮ The structure of intrinsic complexity of learning ⋮ Program self-reference in constructive Scott subdomains ⋮ Learning languages from positive data and a finite number of queries ⋮ Costs of general purpose learning ⋮ Synthesizing noise-tolerant language learners ⋮ Synthesizing learners tolerating computable noisy data ⋮ Comparison of identification criteria for machine inductive inference ⋮ Unnamed Item ⋮ On the amount of nonconstructivity in learning formal languages from text ⋮ Parallelism increases iterative learning power ⋮ Trade-off among parameters affecting inductive inference ⋮ The synthesis of language learners. ⋮ Incremental concept learning for bounded data mining. ⋮ Robust behaviorally correct learning. ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ On the inference of approximate programs ⋮ An invariance notion in recursion theory ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS ⋮ Mapping monotonic restrictions in inductive inference ⋮ Towards a map for incremental learning in the limit from positive and negative information ⋮ Learning languages in the limit from positive information with finitely many memory changes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sexually reproducing cellular automata
- The chemical basis of morphogenesis
- A note on some systems of lindenmayer
- A Note on Degrees of Self-Describing Turing Machines
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
