The following pages link to Automata Studies. (AM-34) (Q3238618):
Displaying 50 items.
- Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation (Q418663) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Turing test considered mostly harmless (Q468595) (← links)
- Comments to my works, written by myself (Q483174) (← links)
- Automata algebras (Q548748) (← links)
- Modelling routing phenomenon with bounds estimation in dioids (Q550653) (← links)
- On probabilistic analog automata (Q596111) (← links)
- Noise-based logic: binary, multi-valued, or fuzzy, with optional superposition of logic states (Q653462) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series (Q704234) (← links)
- Measurement of learning and mental abilities (Q773693) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Iterated sequential transducers as language generating devices (Q861252) (← links)
- Graphical inheritance notation for state-based classes (Q927454) (← links)
- Finite automata and S-R models (Q1230763) (← links)
- Sequential fuzzy system identification (Q1255466) (← links)
- Small universal Turing machines (Q1349852) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- Delay-insensitivity and ternary simulation (Q1575731) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- On the presence of periodic configurations in Turing machines and in counter machines. (Q1853547) (← links)
- The complexity of reversible cellular automata (Q1884853) (← links)
- Algebraic representations for finite-state machines. I. Monoid-ring formulation (Q1913649) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- Synchronization paradigm for protocol testing under multiparty configuration (Q1963369) (← links)
- Criterion of neural generation of automaton functions with time delay (Q2027893) (← links)
- Noncommutative polynomials describing convex sets (Q2031064) (← links)
- Shannon entropy rate of hidden Markov processes (Q2034664) (← links)
- Scattering in quantum dots via noncommutative rational functions (Q2067236) (← links)
- Finite automata (Q2074203) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Minimisation of automata (Q2074212) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Equational theories for automata (Q2074221) (← links)
- Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions (Q2108019) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- Conway's work on iteration (Q2153969) (← links)
- A restricted fragment of the Lambek calculus with iteration and intersection operations (Q2213927) (← links)
- Local laws for polynomials of Wigner matrices (Q2306115) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- Leveraging environmental correlations: the thermodynamics of requisite variety (Q2410023) (← links)
- A note on a Stone-Weierstrass type theorem for set-valued mappings (Q2447628) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Some statistical methods in machine intelligence research (Q2539348) (← links)
- Theory of majority decision elements (Q2539620) (← links)
- Cofunction in composite systems (Q2556380) (← links)
