Automata Studies. (AM-34)
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- Criterion of neural generation of automaton functions with time delay
- Noncommutative polynomials describing convex sets
- Shannon entropy rate of hidden Markov processes
- Scattering in quantum dots via noncommutative rational functions
- 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
- Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions
- Tree automata and pigeonhole classes of matroids. I
- Conway's work on iteration
- A restricted fragment of the Lambek calculus with iteration and intersection operations
- Local laws for polynomials of Wigner matrices
- Generic results for concatenation hierarchies
- Leveraging environmental correlations: the thermodynamics of requisite variety
- A note on a Stone-Weierstrass type theorem for set-valued mappings
- Error-bounded probabilistic computations between MA and AM
- Some statistical methods in machine intelligence research
- Theory of majority decision elements
- Cofunction in composite systems
- 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
- Diagnosis of constant faults in iteration-free circuits over monotone basis
- Moore machines duality
- Minsky Machines and Algorithmic Problems
- My Life as a Logician
- Realizations of non-commutative rational functions around a matrix centre. I: synthesis, minimal realizations and evaluation on stably finite algebras
- Provably Shorter Regular Expressions from Deterministic Finite Automata
- Perceptual-learning machines and the brain
- Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation
- Australasian Association for Logic 1997 Annual Conference
- scientific article; zbMATH DE number 1333447 (Why is no real title available?)
- On the capabilities of systolic systems
- The expressive power of analog recurrent neural networks on infinite input streams
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- Prolegomenon to the relation between social theory and method*
- Permutations of the integers induce only the trivial automorphism of the Turing degrees
- Turing test considered mostly harmless
- Comments to my works, written by myself
- The monoidal structure of Turing machines
- What's behind blast
- What is the Church-Turing Thesis?
- scientific article; zbMATH DE number 7564410 (Why is no real title available?)
- Information theory in neuroscience
- The developments of the concept of machine computability from 1936 to the 1960s
- The Turing test as interactive proof
- New algorithms for solving tropical linear systems
- From Logic to Theoretical Computer Science – An Update
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
- Automata algebras
- Modelling routing phenomenon with bounds estimation in dioids
- Limiting recursion
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- Decision problems for tag systems
- Reordering Derivatives of Trace Closures of Regular Languages.
- The algebra of stream processing functions
- Subset construction complexity for homogeneous automata, position automata and ZPC-structures
- On probabilistic analog automata
- 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
- scientific article; zbMATH DE number 7723593 (Why is no real title available?)
- Toward real-time multi-objective optimization for bus service KPIs
- Tail recursion transformation for invertible functions
- Recognizability in residuated lattices
- Algorithmic complexity for theories of commutative Kleene algebras
- Noise-based logic: binary, multi-valued, or fuzzy, with optional superposition of logic states
- Forwards- and backwards-reachability for cooperating multi-pushdown systems
- Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
- Galilean resonances: the role of experiment in Turing’s construction of machine intelligence
- Divergent predictive states: the statistical complexity dimension of stationary, ergodic hidden Markov processes
- Backwards-reachability for cooperating multi-pushdown systems
- On complete and almost complete constructive metric spaces
- Models and methods of tropical algebra in problems of optimization and operations research
- Derivatives on graphs for the positive calculus of relations with transitive closure
- Free product of formal series
- Regular expressions with backreferences: polynomial-time matching techniques
- A class of rational trace relations closed under composition
- An algebraic theory of nondeterministic finite automata
- On switching finite state automata
- 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
- Finite relational semantics for language Kleene algebra with complement
- Algorithmic complexity of theories with Kleene iteration
This page was built for publication: Automata Studies. (AM-34)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3238618)
