M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):114--125, 1959. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Many Faces of a Translation - McKenzie, Schwentick, Therien.. (2000) (Correct)
....V translations, V single valued NFTs and 2 way V transducers. Keywords: logic in computer science ( nite model theory, descriptive complexity) monoids, automata theory 1 Introduction The regular languages have been characterized in many ways, in particular using DFAs, NFAs, 2 way DFAs [RS59, She59], monadic second order logic [B uc60, Tra61] and nite semigroups [Eil76b] with an incisive algebraic parametrization arising from the latter. For instance, aperiodic DFAs recognize exactly the star free languages [Sch65] and these are precisely captured by FO, i.e. rst order logic with order ....
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res., 3(2):115-125, 1959.
Testing Conformance to a Quasi-Nondeterministic Stream - Hierons, Harman (2000) (2 citations) (Correct)
....FA M is said to be minimal if there is no equivalent deterministic FA with fewer states than M. A deterministic FA M is minimal if it is initially connected and no two states of M are equivalent. Given a nondeterministic FA M, it is possible to derive an equivalent deterministic FA M ([22]) Given a deterministic FA M it is possible to produce some equivalent minimal deterministic FA M ( 20] Thus, given any FA M it is possible to produce a minimal deterministic FA M that is equivalent to M. The nondeterministic FA M 1 given in Figure 1 is, for example, equivalent to the ....
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114--125, 1959.
Masarykova univerzita v Brn e - Rodov Edeck Fakulta (Correct)
....independence relations) which contain just the pairs of commuting letters. The most important class of trace monoids are direct products of free monoids; already in the beginnings of computability theory, certain subsets of these monoids (such as rational and enumerable relations) were studied [34, 20]. General partial commutations were probably first employed in 1969 by Cartier and Foata [11] as a tool for the study of Mobius functions. In the following decades trace monoids appeared in connection with different research fields and a self contained theory of traces has also gradually ....
M.O. Rabin, D. Scott, Finite automata and their decision problems, IBM J. Res. Dev. 3(2) (1959) 114--125.
Two-Way Finite State Transducers with Nested Pebbles - Engelfriet, Maneth (Correct)
....1, DPT k DPT 1 and PT k DPT 1 PT 0 . This result can be used to give a simple proof of the known fact that the domains of our transducers, i.e. the languages accepted by two way k pebble automata (with nested pebbles) are regular. For k = 0 (no pebbles) this is the classical result of [27, 25]. For k = 1, i.e. for two way 1 pebble automata, it is the, also classical, result of [3] For arbitrary k it was rst proved (for a slightly restricted case) in [15] and then in [8] for the more general case of trees (see also [20] The alternative proof is as follows: Since PT k PT 1 , it ....
M.O. Rabin, D. Scott; Finite automata and their decision problems, IBM J. Res. Devel. 3 (1959), 115-125
Two-Way Finite State Transducers with Nested Pebbles - Engelfriet, Maneth (Correct)
....every k 1, DPTk c DPT and PTk C DPT o PT0. This result can be used to give a simple proof of the known fact that the domains of our transducers, i.e. the languages accepted by two way k pebble automata (with nested pebbles) are regular. For k = 0 (no pebbles) this is the classical result of [27,25]. For k = 1, i.e. for two way 1 pebble automata, it is the, also classical, result of [3] For arbitrary k it was first proved (for a slightly restricted case) in [15] and then in [8] for the more general case of trees (see also [20] The alternative proof is as follows: Since PT C PT , it ....
M.O. Rabin, D. Scott; Finite automata and their decision problems, IBM J. Res. Devel. 3 (1959), 115-125
A Finite-State Morphological Processor For Spanish - Tzoukermann, Liberman (1990) (10 citations) (Correct)
....by adding new derivatlonal affixes. aThe name and the basic idea of these automata come from [5] For simplicity of exposition we gloss over various authors attempts to distinguish variously among machines, aatomata and transducerz, as well as the profusion of precursors and de endants in ([15], 16] 2] etc. Our notation is eclectic. i 277 to forms whose surface spelling is the string w, or hose corresponding to the first person plural imperfect subjunctive of such and such a verb. Depending on the structure of H and the property selected, the search will be harder or easier. ....
Rabin, M.O. and D. Scott, 1959. Finite Au- tomata and their Decision Problems, IBM J. Res. 3, pp. 114-125.
ProGram: A Grammar-Based Method for Specification and Hardware.. - Öberg (1999) (Correct)
....grammars and regular expressions are important since they can be used to describe Finite State Machines. Kleene [50] showed in 1956 that the class of regular languages is exactly the same as the class of languages accepted by DFAs. Another important result was presented by Rabin and Scott in 1959 [51]. They showed that the class of regular languages is exactly the same as the class of languages accepted by NFAs and thus that DFAs and NFAs are equivalent. Then there is the Myhill Nerode theorem from 1958 [49, 52, 53] that states that every regular expression has a unique minimum state DFA. This ....
Rabin, M.O., and D. Scott, "Finite Automata and their decision problem", In IBM Journal of Research and Development 3 (1959), pp. 114-125.
Simulation-Guided Property Checking Based on.. - Ruf, Hoffmann.. (2001) (7 citations) (Correct)
....is to remove nondeterminism, i.e. the translation of a nondeterministic to a deterministic state machine. With respect to removing nondeterminism, AR automaton can be treated like standard finite state machines enabling the application of standard algorithms (e.g. sub set construction [10]) We now discuss how the A set and R set of the new AR automaton are inherited. Applying the standard technique for determining an AR automaton, we obtain a new automaton whose states are sets of original states as shown in Figure 2 (the numbers below the states represent unique state identifiers ....
M. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115--125, 1959.
State Complexity: Recent Results and Open Problems - Yu (2004) Self-citation (Rabin Scott) (Correct)
No context found.
M. Rabin and D. Scott, "Finite automata and their decision problems", IBM J. Res. Dev. 3 (1959) 114-125.
Frame Algebra with Synchronous Communication - Jan Bergstra Alban (Correct)
No context found.
M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):114--125, 1959.
Automata-Theoretic Model Checking Revisited - Vardi (Correct)
No context found.
M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115--125, 1959.
Testing Conformance of a Deterministic - Implementation Against.. (Correct)
No context found.
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-125, 1959.
Büchi Complementation: A Forty-Year Saga - Vardi (2006) (Correct)
No context found.
M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115--125, 1959.
A Note on the Reduction of Two-Way Automata to - One-Way Automata Moshe (Correct)
No context found.
Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Research and Development, 3(1959), pp. 114--125.
Büchi Complementation Made Tighter - Friedgut, Kupferman, Vardi (2004) (Correct)
No context found.
M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
Testing Conformance of a Deterministic Implementation against .. - Hierons, Harman (2001) (2 citations) (Correct)
No context found.
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-125, 1959.
Monoids and the State Complexity of the Operation root(L) - Krawetz (2003) (Correct)
No context found.
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop. 3 (1959), 114--125.
Minimal Unambiguous εNFA - John (2004) (Correct)
No context found.
Rabin, M. O. and Scott, D. S. (1959). Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-- 125.
Syntactic Semigroups - Pin (1997) (24 citations) (Correct)
No context found.
M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. and Develop. 3, (
Generating Candidates when testing a deterministic implementation .. - Hierons (2002) (Correct)
No context found.
M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-125, 1959.
Efficient Approaches to - Subset Construction By (Correct)
No context found.
M.O. Rabin and D. Scott. Finite automata and their decision problems, pages 114--125. IBM Journal of Research and Development 3, 1959.
Energy Aware Computing Through Probabilistic Switching: A Study of .. - Palem (Correct)
No context found.
M. O. Rabin and D. S. Scott, "Finite automata and their decision problems," IBM J. Res. Develop., vol. 3, no. 2, pp. 115--125, 1959.
The Delta Operation: - From Strings To (Correct)
No context found.
M. O. Rabin, D. Scott; Finite automata and their decision problems, IBM J. Res. 3 (1959), 115-125
On the Power of Finite Automata with both Nondeterministic - And Probabilistic States (Correct)
No context found.
M. O. Rabin and D. Scott. Finite automata and their decision problems, IBM J. Research, 3(2) (1959), 115--125.
Automata and Formal Languages - Perrin (2003) (Correct)
No context found.
Michael O. Rabin and Dana Scott. Finite automata and their decision prob- lems. IBM journal of Research and developpement, 3:114-125, 1959.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC