Automata Studies. (AM-34)

DOI10.1515/9781400882618zbMath0074.11204OpenAlexW2497896745WikidataQ130397586 ScholiaQ130397586MaRDI QIDQ3238618

No author found.

Publication date: 1956

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

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Theory of computing (68Qxx)

Related Items (86)

The Turing Test as Interactive Proof ⋮ Australasian Association for Logic 1997 Annual Conference ⋮ Parsimonious computational completeness ⋮ The complexity of reversible cellular automata ⋮ To the history of the appearance of the notion of the \(\varepsilon\)-entropy of an authomorphism of a Lebesgue space and \((\varepsilon,T)\)-entropy of a dynamical system with continuous time ⋮ What is the Church-Turing Thesis? ⋮ Small universal Turing machines ⋮ Diagnosis of constant faults in iteration-free circuits over monotone basis ⋮ On the capabilities of systolic systems ⋮ Tree automata and pigeonhole classes of matroids. I ⋮ Conway's work on iteration ⋮ Limiting recursion ⋮ Iterated sequential transducers as language generating devices ⋮ Algebraic representations for finite-state machines. I. Monoid-ring formulation ⋮ On probabilistic analog automata ⋮ Leveraging environmental correlations: the thermodynamics of requisite variety ⋮ PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ Minsky Machines and Algorithmic Problems ⋮ From regular expressions to DFA's using compressed NFA's ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Automata and one-dimensional TQFTs with defects ⋮ On counting propositional logic and Wagner's hierarchy ⋮ Toward real-time multi-objective optimization for bus service KPIs ⋮ Tail recursion transformation for invertible functions ⋮ Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation ⋮ Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation ⋮ Moore machines duality ⋮ Recognizability in residuated lattices ⋮ Decision problems for tag systems ⋮ The expressive power of analog recurrent neural networks on infinite input streams ⋮ New algorithms for solving tropical linear systems ⋮ Unnamed Item ⋮ A restricted fragment of the Lambek calculus with iteration and intersection operations ⋮ On extremal cases of Hopcroft's algorithm ⋮ Provably Shorter Regular Expressions from Deterministic Finite Automata ⋮ Perceptual-learning machines and the brain ⋮ Synchronization paradigm for protocol testing under multiparty configuration ⋮ A note on a Stone-Weierstrass type theorem for set-valued mappings ⋮ Noise-based logic: binary, multi-valued, or fuzzy, with optional superposition of logic states ⋮ Turing test considered mostly harmless ⋮ Graphical inheritance notation for state-based classes ⋮ Comments to my works, written by myself ⋮ Reordering Derivatives of Trace Closures of Regular Languages. ⋮ My Life as a Logician ⋮ Prolegomenon to the relation between social theory and method* ⋮ The monoidal structure of Turing machines ⋮ Automata algebras ⋮ On deterministic finite automata and syntactic monoid size ⋮ Modelling routing phenomenon with bounds estimation in dioids ⋮ On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series ⋮ The algebra of stream processing functions ⋮ A probabilistic model of computing with words ⋮ Finite automata and S-R models ⋮ Unnamed Item ⋮ Criterion of neural generation of automaton functions with time delay ⋮ Error-bounded probabilistic computations between MA and AM ⋮ Noncommutative polynomials describing convex sets ⋮ Subset construction complexity for homogeneous automata, position automata and ZPC-structures ⋮ Shannon entropy rate of hidden Markov processes ⋮ From Logic to Theoretical Computer Science – An Update ⋮ Optimal Lower Bounds on Regular Expression Size Using Communication Complexity ⋮ Sequential fuzzy system identification ⋮ Realizations of non‐commutative rational functions around a matrix centre, I: synthesis, minimal realizations and evaluation on stably finite algebras ⋮ Local laws for polynomials of Wigner matrices ⋮ Some statistical methods in machine intelligence research ⋮ Theory of majority decision elements ⋮ Generic results for concatenation hierarchies ⋮ Scattering in quantum dots via noncommutative rational functions ⋮ Unnamed Item ⋮ Finite automata ⋮ Automata and rational expressions ⋮ Minimisation of automata ⋮ Descriptional complexity of regular languages ⋮ Černý's conjecture and the road colouring problem ⋮ Equational theories for automata ⋮ Cofunction in composite systems ⋮ Measurement of learning and mental abilities ⋮ What’s Behind Blast ⋮ Delay-insensitivity and ternary simulation ⋮ An efficient null-free procedure for deciding regular language membership ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Canonical derivatives, partial derivatives and finite automaton constructions. ⋮ On the presence of periodic configurations in Turing machines and in counter machines. ⋮ Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions ⋮ The presence of a zero in an integer linear recurrent sequence is NP-hard to decide

This page was built for publication: Automata Studies. (AM-34)