Automata Studies. (AM-34)

DOI10.1515/9781400882618zbMath0074.11204MaRDI QIDQ3238618

No author found.

Publication date: 1956

Full work available at URL: https://doi.org/10.1515/9781400882618

Mathematics Subject Classification ID

00B15: Collections of articles of miscellaneous specific interest

68-06: Proceedings, conferences, collections, etc. pertaining to computer science

68Qxx: Theory of computing

Related Items

On the capabilities of systolic systems, Prolegomenon to the relation between social theory and method*, From Logic to Theoretical Computer Science – An Update, Optimal Lower Bounds on Regular Expression Size Using Communication Complexity, Limiting recursion, Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation, Decision problems for tag systems, The algebra of stream processing functions, Subset construction complexity for homogeneous automata, position automata and ZPC-structures, Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation, The expressive power of analog recurrent neural networks on infinite input streams, Automata algebras, Modelling routing phenomenon with bounds estimation in dioids, On probabilistic analog automata, Noise-based logic: binary, multi-valued, or fuzzy, with optional superposition of logic states, On deterministic finite automata and syntactic monoid size, On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series, Measurement of learning and mental abilities, Iterated sequential transducers as language generating devices, Graphical inheritance notation for state-based classes, Finite automata and S-R models, Sequential fuzzy system identification, Small universal Turing machines, From regular expressions to DFA's using compressed NFA's, Delay-insensitivity and ternary simulation, An efficient null-free procedure for deciding regular language membership, The presence of a zero in an integer linear recurrent sequence is NP-hard to decide, A probabilistic model of computing with words, Canonical derivatives, partial derivatives and finite automaton constructions., On the presence of periodic configurations in Turing machines and in counter machines., The complexity of reversible cellular automata, Algebraic representations for finite-state machines. I. Monoid-ring formulation, On extremal cases of Hopcroft's algorithm, Synchronization paradigm for protocol testing under multiparty configuration, Error-bounded probabilistic computations between MA and AM, Some statistical methods in machine intelligence research, Theory of majority decision elements, Cofunction in composite systems, Provably Shorter Regular Expressions from Deterministic Finite Automata, Perceptual-learning machines and the brain, Australasian Association for Logic 1997 Annual Conference