Periodicity in generations of automata
From MaRDI portal
Publication:4047534
DOI10.1007/BF01761704zbMATH Open0295.02019DBLPjournals/mst/Case74OpenAlexW2041249678WikidataQ56656242 ScholiaQ56656242MaRDI QIDQ4047534FDOQ4047534
Authors: John Case 
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)
Cites Work
- The chemical basis of morphogenesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Note on Degrees of Self-Describing Turing Machines
- Title not available (Why is that?)
- A note on some systems of lindenmayer
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- Sexually reproducing cellular automata
Cited In (52)
- Secretive interaction. Players and strategies
- Learning and classifying
- Parallelism Increases Iterative Learning Power
- Kolmogorov numberings and minimal identification
- Costs of general purpose learning
- Learning languages from positive data and a finite number of queries
- Reflecting and self-confident inductive inference machines
- Program self-reference in constructive Scott subdomains
- Machine learning of higher-order programs
- The structure of intrinsic complexity of learning
- Learning languages in the limit from positive information with finitely many memory changes
- The synthesis of language learners.
- Iterative learning from texts and counterexamples using additional information
- Learning-theoretic perspectives of acceptable numberings
- On the power of recursive optimizers
- Computability-theoretic learning complexity
- Parsimony hierarchies for inductive inference
- Infinitary self-reference in learning theory
- The independence of control structures in abstract programming systems
- Dynamically Delayed Postdictive Completeness and Consistency in Learning
- Effectivity questions for Kleene's recursion theorem
- From Turing machines to computer viruses
- A solution to Wiehagen's thesis
- An invariance notion in recursion theory
- A map of update constraints in inductive inference
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Learning secrets interactively. Dynamic modeling in inductive inference
- Title not available (Why is that?)
- On the amount of nonconstructivity in learning formal languages from text
- The complexity of index sets of classes of computably enumerable equivalence relations
- Strongly non-U-shaped language learning results by general techniques
- Learnability: admissible, co-finite, and hypersimple languages
- Robust learning -- rich and poor
- Iterative learning from positive data and counters
- Dynamic Modeling in Inductive Inference
- Universal computably enumerable equivalence relations
- Comparison of identification criteria for machine inductive inference
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Towards a map for incremental learning in the limit from positive and negative information
- Mapping monotonic restrictions in inductive inference
- Parallelism increases iterative learning power
- Jumps of computably enumerable equivalence relations
- On aggregating teams of learning machines
- On the inference of approximate programs
- One-sided error probabilistic inductive inference and reliable frequency identification
- Trade-off among parameters affecting inductive inference
- Robust behaviorally correct learning.
- On learning of functions refutably.
- Learning in the presence of inaccurate information
- Incremental concept learning for bounded data mining.
- On a question about learning nearly minimal programs
This page was built for publication: Periodicity in generations of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047534)
