Results 221 to 230 of about 3,110 (267)
Some of the next articles are maybe not open access.
Philosophy, 1958
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.
openaire +1 more source
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.
openaire +1 more source
Acta Informatica, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Meduna, Petr Zemek
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Meduna, Petr Zemek
openaire +3 more sources
On the transformation of two-way finite automata to unambiguous finite automata
Information and Computation, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semyon Petrov, Alexander Okhotin
openaire +3 more sources
Bell System Technical Journal, 1960
Since it is not clear, in general, how an automaton should best be characterized, one of the purposes of this paper is to find ways to go from one characterization to another. In doing so, we hare not been completely impartial — the programming approach has been emphasized more than the others. There are perhaps two reasons for this emphasis: First and
openaire +1 more source
Since it is not clear, in general, how an automaton should best be characterized, one of the purposes of this paper is to find ways to go from one characterization to another. In doing so, we hare not been completely impartial — the programming approach has been emphasized more than the others. There are perhaps two reasons for this emphasis: First and
openaire +1 more source
2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961), 1961
This paper concerns switching networks which consist of n identical combinational logic cells interconnected from left to right by alpha communication channels into linear arrays. The synchronous cells in these networks have unit switching delays separating their receipts of external x and left-neighbor alpha inputs from their corresponding productions
Calvin C. Elgot, Joseph D. Rutledge
openaire +1 more source
This paper concerns switching networks which consist of n identical combinational logic cells interconnected from left to right by alpha communication channels into linear arrays. The synchronous cells in these networks have unit switching delays separating their receipts of external x and left-neighbor alpha inputs from their corresponding productions
Calvin C. Elgot, Joseph D. Rutledge
openaire +1 more source
Canadian Journal of Mathematics, 1965
A finite automaton may be thought of as a possible abstraction of a digital computer. Imagine a tape or sequence of letters from some alphabet being fed into a device with a finite number of internal states. When the device is in a particular state and receives an input letter, the system passes to another internal state and prints a letter on an ...
openaire +2 more sources
A finite automaton may be thought of as a possible abstraction of a digital computer. Imagine a tape or sequence of letters from some alphabet being fed into a device with a finite number of internal states. When the device is in a particular state and receives an input letter, the system passes to another internal state and prints a letter on an ...
openaire +2 more sources
DECIDABILITY IN FINITE AUTOMATA
1993In the first part of the paper, applying reduction to the Post Correspondence Problem, it is shown that for deterministic finite two- tape automata --- for which the equivalence problem is decidable --- the inclusion problem is undecidable. Then, the equivalence decision problem for nondeterministic automata with multiplicities is presented and is ...
openaire +3 more sources
1979
Beside the question of nondeterminism the connection between time and space is the most urgent problem in automata theory. In this paper we introduce a new storage medium with properties between space and time: the finite-change tape (FC-tape), a Turing tape, on which every cell can be changed only a bounded number of times.
Burchard von Braunmühl, Rutger Verbeek
openaire +2 more sources
Beside the question of nondeterminism the connection between time and space is the most urgent problem in automata theory. In this paper we introduce a new storage medium with properties between space and time: the finite-change tape (FC-tape), a Turing tape, on which every cell can be changed only a bounded number of times.
Burchard von Braunmühl, Rutger Verbeek
openaire +2 more sources
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata
2021The paper estimates the number of states in an unambiguous finite automaton (UFA) that is sufficient and in the worst case necessary to simulate an n-state two-way deterministic finite automaton (2DFA). It is proved that a 2DFA with n states can be transformed to a UFA with fewer than \(2^n \cdot n!\) states.
Semyon Petrov, Alexander Okhotin
openaire +3 more sources
2007
Journal of Automata, Languages and Combinatorics, Volume 16, Numbers 2-4, 2011, 91 ...
Henning Bordihn +2 more
openaire +2 more sources
Journal of Automata, Languages and Combinatorics, Volume 16, Numbers 2-4, 2011, 91 ...
Henning Bordihn +2 more
openaire +2 more sources