
	Where results make sense

Topic: Rabin automaton

Related Topics

cellular automaton

finite state automaton

pushdown automaton

Rule 110 cellular automaton

Continuous automaton

Rabin automaton

Alternating automaton

chess playing automaton

nondeterministic finite tree automaton

System Integrated Automaton parser

non deterministic finite automaton

deterministic tree automaton

In the News (Sun 20 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Kids.Net.Au - Encyclopedia > Finite state automaton
		A finite state machine (FSM) or finite state automaton (FSA) is an abstract machine used in the study of computation and languages that has only a finite, constant amount of memory (the state).
		Finite automata may operate on languages of finite words (the standard case), infinite words (Rabin automata, Büchi automata[?]), or various types of trees (tree automata), to name the most important cases.
		Non-deterministic automata are usually implemented by converting them to deterministic automata - in the worst case, the generated deterministic automaton is exponentially bigger than the non-deterministic automaton (although it can usually be substantially optimised).
	www.kids.net.au /encyclopedia-wiki/fi/Finite_state_automaton (856 words)

	Basics of Automata Theory
		An automaton in which the state set Q contains only a finite number of elements is called a finite-state machine (FSM).
		They can operate on languages with a finite number of words (standard case), an infinite number of words (Rabin automata, Bïrche automata), various types of trees, and in hardware circuits, where the input, the state and the output are bit vectors of a fixed size.
		The Turing machine can be thought of as a finite automaton or control unit equipped with an infinite storage (memory).
	www.stanford.edu /~jcackler/automata/basics.htm (1640 words)

	Memory Minimisation in Control with Stochastic Automata
		is to be regarded as a performance function, since we shall consider the problem of regulating the inputs to the automaton to cause its output to become, and remain, 1.
		An explicit construction of such a universal frustration automaton for regulators with n or less states is as follows.
		In these terms, the success of the stochastic regulator in dealing with the same plant may be seen to be due to the inherent acyclicity, or unpredictability, of its output.
	pages.cpsc.ucalgary.ca /~gaines/reports/SYS/MemMin71/index.html (1011 words)

	Intro to Algorithms: CHAPTER 34: STRING MATCHING
		Rabin and Karp have proposed a string-matching algorithm that performs well in practice and that also generalizes to other algorithms for related problems, such as two-dimensional pattern matching.
		There is a string-matching automaton for every pattern P; this automaton must be constructed from the pattern in a preprocessing step before it can be used to search the text string.
		The Rabin-Karp algorithm was proposed by Rabin and Karp [117], and the Boyer-Moore algorithm is due to Boyer and Moore [32].
	serghei.net /docs/programming/Cormen/chap34.htm (8319 words)

	Springer Online Reference Works (Site not responding. Last check: )
		Automaton, finite) or one of its modifications obtained by changing components or the mode of operation.
		However, the highly general nature of the concept of a non-deterministic automaton is reflected in the fact that a different number of states may be necessary to represent the same event using a non-deterministic automaton and using a finite automaton.
		In its behaviour, an automaton with a variable structure is equivalent to an infinite automaton with finite input and output alphabets and with a countable set of states.
	eom.springer.de /a/a014120.htm (2098 words)

	NationMaster - Encyclopedia: Deterministic finite state machine (Site not responding. Last check: )
		In the theory of computation, a deterministic finite state machine or deterministic finite automaton (DFA) is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state.
		The state diagram for M is: In Automata Theory, a state transition table is a table describing the transition function T of a finite automaton.
		In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states.
	www.nationmaster.com /encyclopedia/Deterministic-finite-state-machine (1486 words)

	Reference.com/Encyclopedia/Michael O. Rabin
		Michael Oser Rabin (born 1931 in Breslau, Germany, today in Poland) is a noted computer scientist and a recipient of the Turing Award, the most prestigious award in the field.
		Rabin was born as the son of a rabbi in what was then known as Breslau (it became Wrocław, and part of Poland, after the Second World War).
		In 1981, Rabin invented the technique of oblivious transfer, allowing a sender to transmit a message to a receiver where the receiver has some probability between 0 and 1 of learning the message, with the sender being unaware whether the receiver was able to do so.
	www.reference.com /browse/wiki/Michael_O._Rabin (449 words)

	Büchi automaton
		A Büchi automaton is the extension of a finite state automaton to infinite inputs.
		It accepts an infinite input sequence, iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which has infinitely many states in the set of final states.
		A language defined by a Rabin automaton, Streett automaton, parity automaton, or Muller automaton is also omega-regular.
	www.xasa.com /wiki/en/wikipedia/b/bu/buechi_automaton.html (337 words)

	ltl2dstar documentation
		When we consider the acceptance condition not in the context of the whole automaton but in the context of every indiviual state, we get the acceptance signature of a state: A string of the indizes of the acceptance pairs the state is a member of.
		automaton : output a textual representation of the automaton.
		The generated automaton is output by the translator on the standard output.
	www.ltl2dstar.de /docs/ltl2dstar.html (1854 words)

	Habilitationsschrift
		For finite sequential automata, several answers are known to the question which properties can be checked by a finite sequential automaton: Kleene showed that these are precisely the rational properties.
		Furthermore, Büchi (1960) and Elgot (1961) showed that a property of words can be checked by a finite sequential automaton if it can be expressed in the monadic second order logic.
		This restriction makes it possible to relabel a (S,k)-dag by an asynchronous cellular automaton in such a way that one obtains a dependence graph over a certain dependence alphabet.
	www.informatik.uni-leipzig.de /~kuske/habil (3733 words)

	Special report: Celebrating 50 years of the IBM Journals \| Finite automata and their decision problems
		Each one-tape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera.
		Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
		In this classic paper, Rabin and Scott introduced the concept of nondeterministic machines, which play a key role in computational complexity theory, and in the description of complexity classes P and NP in particular.
	www.research.ibm.com /journal/50th/methodologies/rabin.html (186 words)

	[No title]
		The standard solution of regular expression patterns matching problem is to construct Rabin-Scott automaton [2] for each pattern and add extra initial state with the alphabet S loop and draw epsilon transitions from the added state to all the initial states of all patterns.
		The complexity of the factor automaton construction is O(N) for a minimal deterministic automaton [8] and O(1) for non-deterministic automaton.
		While the matching algorithm based on intersection of minimal deterministic factor automaton of the input text with automaton of rules showed poorer running time than algorithm based on intersection with non-deterministic factor automaton, we believe it can be improved by more accurate implementation of the factor automaton construction.
	www.dialog-21.ru /Archive/2004/Olonichev.htm (1867 words)

	Intro to Algorithms: CHAPTER 34: STRING MATCHING
		Many string-matching algorithms build a finite automaton that scans the text string T for all occurrences of the pattern P.
		We then examine a special string-matching automaton and show how it can be used to find occurrences of a pattern in a text.
		Figure 34.6 (a) A state-transition diagram for the string-matching automaton that accepts all strings ending in the string ababaca.
	www.personal.kent.edu /~mlu3/CSCourses/AdvAlgorithms/CLR-BOOK/books/book6/chap34.htm (8319 words)

	CiteULike: Size of Finite Probabilistic and Quantum Automata (Site not responding. Last check: )
		Rabin[Rab63] proved that if arbitrary language is accepted by some probabilistic automaton with an isolated cutpoint then there exists some deterministic automaton that accepts this language.
		He showed that for any probabilistic automaton with n states, r accepting states and radius of isolation J the equivalent deterministic automaton has at most (1 +) states.
		However it appeared to be a problem to construct a concrete language for which deterministic automaton would really have to have such...
	www.citeulike.org /user/charibeiro/article/505166 (257 words)

	Citations: Regular expressions for infinite trees and a standard form of automata - Mostowski (ResearchIndex)
		....condition for these is based on requiring that an automaton has a tree like structure, and checking whether the oldest infinitely often occurring state in a path of a run belongs to a designated set of accepting states.
		....A tree automaton is said to be deterministic iff for every q 2 Q and a 2 Sigma there is at most one pair (q l ; q r) 2 Q such that (q; a; q l ; q r) 2 ffi.
		Transformation from Muller to Rabin automata is rather standard, although it may increase the size of an automaton exponentially.
	citeseer.ist.psu.edu /context/105800/0 (3382 words)

	FLoC 2006 - LICS
		The parity condition is much simpler than the Rabin condition.
		In this paper we improve the complexity of solving Rabin and Streett games to approximately the square root of previous bounds.
		We also define an equivalent automaton model extending Buchi automata.
	www.easychair.org /FLoC-06/LICS-day225.html (1764 words)

	CS Colloquium --- 2003
		deterministic Rabin automaton with $n^{O(n)}$ states and $n$ pairs.
		For a Streett automaton with $n$ states and $k$ pairs, Safra
		constructs a deterministic Rabin automaton with $(nk)^{O(nk)}$ states
	www.math.tau.ac.il /~roded/colloq/27.11.05.html (196 words)

	Computing the Rabin index of a parity automaton (Site not responding. Last check: )
		Le nombre de valeurs utilisées par une condition d'acceptation à parité est toujoues supérieur à l'indice de Rabin et réciproquement, une condition d'acceptation à parité peut toujours être remplacée par une condition d'acceptation équivalente dont le nombre de valeurs utilisées est exactement l'indice de Rabin.
		The Rabin index of a rational language of infinite words given by a parity automaton with n states is computable in time O(n
		The number of values used by a parity acceptance condition is always greater than the Rabin index and conversely, the acceptance condition of a parity automaton can always be replaced by an equivalent acceptance condition whose number of used values is exactly the Rabin index.
	www.liafa.jussieu.fr /~carton/Publications/Parity (191 words)

	DLT06: Abstract for Paper (Site not responding. Last check: )
		Rabin [Rabi] initiated the study of probabilistic finite automaton (PFA).
		Rabin's work showed a crucial role of the gap in the error bound (for accepting and non-accepting computations) in the power of the model.
		Further work resulted in the identification of qualitatively different error models (one-sided error, bounded and unbounded errors, no error etc.) Borodin, Cook and Pippenger [Boro] introduced a model of probabilistic space-bounded computation in which the outcomes of the coin tosses of the device can be accessed multiple times.
	dlt2006.cs.ucsb.edu /63.html (198 words)

	Information and Computation Bibliography (Site not responding. Last check: )
		Computing the Rabin index of a regular language of infinite words.
		The Rabin index of a regular language of infinite words is the minimum number of accepting pairs used in any deterministic Rabin automaton recognizing this language.
		Testing and generating infinite sequences by a finite automaton.
	theory.lcs.mit.edu /~iandc/References/wilkey1996:61.html (153 words)

	DNA - Money - Genpact IPO = blowout gains for Oakhill, General Atlantic - Daily News & Analysis (Site not responding. Last check: )
		Genpact leaders want to sale the services even after developing the product and their thought of a product is an automaton.The automaton will churn the service (in place of the so called skilled Genpact associate) as they think that will reduce their labor cost.
		What will that automaton do...it won't run any deep math algorithm behind it (as all mathematicians have left Genpact).
		No one till date has made such an absurd automaton (please name any company if you know to enlighten me) and none will ever will, save Genpact.
	www.dnaindia.com /report.asp?NewsID=1096590 (0 words)

	Amazon.com: "Rabin Index": Key Phrase page (Site not responding. Last check: )
		The Rabin index of a recognizable set X C A", denoted i (X), is the least integer n such that X can be...
		0(n rk) states and l pairs, where k is the Streett index of the language and 1 is the Rabin index of the language.
		The Rabin (Streett) index of a language is the number of pairs needed in the acceptance condition...
	www.amazon.com /phrase/Rabin-Index (381 words)

	LICS - 1996 (Site not responding. Last check: )
		In the late 60's, Rabin proved that Buchi tree automata are less expressive than Rabin tree automata.
		For a word language L, the derived language of L, denoted L/spl Delta/, is the set of all trees all of whose paths are in L. Since often we want to specify that all the computations of the program satisfy some property, the interest in derived languages is clear.
		Our main result shows that L is recognizable by a nondeterministic Buchi word automaton but not by a deterministic Buchi word automaton iff L/spl Delta/ is recognizable by a Rabin tree automaton and not by a Buchi tree automaton.
	www.lfcs.inf.ed.ac.uk /events/lics/1996/KupfermanSafraVardi-Relatingwordandtree.html (331 words)

	ACM Press Release
		New York, May 24, 2004 -- ACM has recognized four leading theoretical scientists for their contributions to realizing the practical uses of cryptography and for demonstrating the power of algorithms that make random choices.
		In the mid-1970s, first Robert M. Solovay and Volker Strassen working together, and independently Michael O. Rabin, building on a deterministic algorithm by Gary L. Miller, introduced random algorithms (detailed sequences of actions to accomplish a task), and formulas to test whether a number is prime.
		Both the Solovay-Strassen test and the Miller-Rabin test are included in a range of cryptographics products, and a version of the Miller-Rabin test published by Dr. Rabin in 1980 is specified in many cryptographic standards.
	www.acm.org /announcements/kanellakis.5-26-2004.html (324 words)

	D. J. Bernstein / Talks
		It turns out to be possible to compress RSA keys and signatures to a fraction of their original size.
		Even better compression is possible for the Rabin system, an improved version of RSA.
		This talk will explain the latest compression techniques.
	cr.yp.to /talks.html (5453 words)

	Random Sequence Generation by Cellular Automata (1986)
		[24] J. Milnor, Entropy of cellular automaton-maps, Institute for Advanced Study preprint, May 1984; Directional entropies of cellular automaton maps, Institute for Advanced Study preprint, October 1984.
		Sinai, An answer to a question by J. Milnor, Comment.
		[39] T. Toffoli, CAM: A high-performance cellular-automaton machine, Physica D 10 (1984), 195; K. Steiglitz and R. Morita, A multi-processor cellular automaton chip, in ``Proc.
	www.stephenwolfram.com /publications/articles/ca/86-random/17/text.html (0 words)

	NECSI: The Complex World
		Excluded volume is also preserved as monomers in the same space are prevented from moving on top of each other.
		All monomers in one space can be moved simultaneously, and the movement algorithm is local, so this simulation qualifies as a Monte Carlo simulation and as a stochastic Cellular Automaton.
		For further information see Y. Bar-Yam, Y. Rabin, M. Smith, Macromolecules Rep., 25 (1992) 2985.
	www.necsi.org /Visualizations/interactive_polymer.html (263 words)

	String Matching Notes
		However, the time required to build the automaton
		The Knuth-Morris-Pratt algorithm has a clever way around the time needed to build the automaton.
		It uses an auxilary function, the prefix function, which is computed from the pattern in time O(m).
	csr.uvic.ca /~wendym/courses/425/notes/String_Matching_Notes.html (1089 words)

	Special Seminar
		ITS DECISION: The set of infinite call sequences cs = c1 c2 c3...
		with an infinitely descending thread is omega-regular: accepted by a finite-state Buechi or Rabin automaton.
		These automata have all the properties of usual finite automata on finite words, with well-understood algorithms to test for infiniteness, containment, etc. The criterion tests equality of two omega-regular sets.
	web.comlab.ox.ac.uk /oucl/seminars-ht01/extra/jones.html (216 words)

	Pattern Matching
		Blumer A., Blumer J., Haussler D., Ehrenfeucht A., Chen M.T., and Seiferas J., The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40(1), 31-55, 1985.
		Blumer A., Blumer J., Haussler D., Ehrenfeucht A., Chen M.T., Seiferas J., The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 31-55, 1985.
		Navarro G., A partial deterministic automaton for approximate string matching, in Proc WSP 97, 112-124, Carleton University Press, 1997.
	www.softpanorama.org /Algorithms/pattern_matching.shtml (5734 words)

Try your search on: Qwika (all wikis)