Cluster analysis - Revision history

en>Anita5192: Undid revision 638466163 by 167.205.22.104 (talk)Reverted unexplained addition of text

2014-12-18T20:55:55Z

Undid revision 638466163 by 167.205.22.104 (talk)Reverted unexplained addition of text

← Older revision		Revision as of 22:55, 18 December 2014
Line 1:		Line 1:
	~~Friends contact him Royal Cummins~~. ~~The preferred pastime for him and his kids~~ is to ~~drive~~ and ~~now he is attempting~~ to ~~make money~~ with it. ~~Interviewing~~ is ~~what~~ she ~~does in her day occupation but quickly her husband and her~~ will ~~begin~~ their ~~personal company~~. ~~He currently lives~~ in ~~Arizona and his parents live nearby~~.<br><br>~~my web blog~~ :: [http://~~gojocinema~~.com/~~profile~~.~~php~~?u=~~PoThielen gojocinema~~.com]		Each and every golf player that enjoys the overall game is generally a large enthusiast associated with golfing publications. No matter what the actual publications tend to be regarding so long as it's some thing related to golfing or even PGA gamers. They'll study all of them in your own home, in the office, within the restroom, within the physicians or even dentist's waiting around space, in the event that there is a golfing guide within the heap they will search towards the base to obtain this. I believe it is the main golf players obsession with the overall game and also the endless problem inside him/her personal in order to constantly improve. Golfing publications give a large prosperity associated with understanding offered type additional gamers, teachers, as well as critics. Any kind of golf player who's seriously interested in the overall game usually really wants to understand whenever possible by what might help their own online game. Golfing publications will be couple of various variations that each golf player will love. The very first the first is the actual usually well-liked coaching or even golfing ideas guide. Each and every golf player may happily study one of these simple publications as long as they be accessible. These types of publications could be compiled by previous PGA golfing benefits, the actual actually well-liked PGA golfing teachers, or even celebs providing their own stage associated with sights. The actual golf player that scans these types of wants that certain small point that she or he may attempt that will assist their own video games. It may be 1 small suggestion about how exactly in order to fall into line the putt much better, however the pass away difficult golf player is actually willing to see the whole
			every other athletic shoe I had put together possibly worn out. That it was special. Definite special. The idea this baseball guides gives so that you can game enthusiasts.Exactly how Reading through Golfing Publications May Significantly Enhance Your own Online game

			<a href=http://www.firetruckky.com/>gamma blue 11 for sale</a>

			Down water skiing calls for combining athleticism, amusement, benefit, plus the devil-may-care perspective that permits contributors to relish your buzz involving, in essence, plummeting along a new sharp snow-covered huge batch, continuously. It isn't really an activity to the weak in the mind. Zero speculate it's actually a plan place throughout countless John Connect videos, wherever many of us discover each of our secret-agent main character zigzagging along your globe's nearly all unsafe hills while nasty agents get photographs in your ex via earlier mentioned. Alpine water skiing can be natural adrenaline, unlike your long-haul shuffling in the game from where the idea designed, cross-country water skiing. Alpine water skiing can be, until recently, a new variation involving cross-country water skiing that skill level expertise -- those people mls along with mls involving ordinary, generally level traversing -- are generally modified out and a
			regarding descent) for newbies, more advanced skiers, and also professionals. Accommodations inside the Gulf frequently have several works inside each and every group, although Midwestern accommodations inside areas enjoys Il and also countryside Mn (states offering one of the most steady wintry weather conditions inside the country) routinely have much less works. Yet specialist skiers mention in which at times it really is safer to devote the initial snowboarding vacation exercising repeatedly for a passing fancy novice and also more advanced works; muscle tissue can understand the mandatory motions far better, the coordination will establish, and also on your own subsequent snowboarding vacation, you will end up readier to handle the particular difficulties regarding more advanced and in the end specialist works. All things considered, snow skiing, just like cello enjoying or perhaps snow roller skating, is dependent upon obtaining the essentials totally straight down cool : when you are going to justification any pun.Alpine Water skiing: An activity To the Strong

			<a href=http://www.retrodav.com/>cheap bred 11</a>

			The earliest action with the the top of action is actually a broad drive of your sides left, finally with a computerized resorting of your sides. This is certainly real. Nonetheless you can find above this. Locations superb guidelines to develop a person's downswing. A sides shouldn't exclusively switch left plus move, its action needs to be hence meticulously strapped left left arm not wearing running shoes takes in a left arm as well as pub all the way down plus whips these folks in the tennis ball. As a final point it's essential to move a person's sides for whatever target as they quite simply arrive at a ext of their total broad action. Will be a person's sides possibly in such a posture while you click a tennis ball? How things go about, essentially, is definitely the fact that kept left arm on its own is yanked by sides. A left arm is a relating pole regarding the s
			tion accumulated because of the backward bust has become presented, the other knuckle on the eventually left give need to be apparent in addition to a couple on the suitable, this clb experience need to be on in regards to 45-degree point of view while using the surface, the suitable adjustable rate mortgage need to be corporation. up against the, suitable area, in case this body include used since they really should, the participant must be able to view the away from his or her suitable calf on the trendy towards foot or so. Except finding this not in the suitable calf, most of these look at details usually are precisely the same since they were being as soon as the stationery hand bust within the backswing. When you abide by the following pointers ones move will probably strengthen not any conclude. There ought to be an explicit, cognizant emotion that it is occurring. Is it doesn't sole biggest mobility that your beneficial individual helps make. This may not be for being mixed up while using the incorrectly recognized tips to get started section of the human body be returning.Actively playing golf Recommendations: A All the way down Action

			<a href=http://www.firetruckky.com/>cheap jordan 11</a>

			Related Links: http://www.genomenglish.com/

en>Wavelength: inserting 1 hyphen: —> "three-dimensional"—wikt:three-dimensional

2014-02-27T00:01:38Z

inserting 1 hyphen: —> "three-dimensional"—wikt:three-dimensional

← Older revision		Revision as of 02:01, 27 February 2014
Line 1:		Line 1:
	~~In [[theoretical computer science]], more precisely in the theory of [[formal languages]], the '''star height''' is a measure for the structural complexity~~		Friends contact him Royal Cummins. The preferred pastime for him and his kids is to drive and now he is attempting to make money with it. Interviewing is what she does in her day occupation but quickly her husband and her will begin their personal company. He currently lives in Arizona and his parents live nearby.<br><br>my web blog :: [http://gojocinema.com/profile.php?u=PoThielen gojocinema.com]
	~~of [[Regular_expression#Formal_language_theory\|regular expressions]]: The star height equals the maximum nesting depth of stars appearing in the regular expression~~.
	The ~~concept of star height was first defined~~ and ~~studied by Eggan (1963).~~

	~~==Formal definition==~~
	~~More formally, the star height of a [[Regular_expression#Formal_language_theory\|regular expression]]~~
	~~''E'' over a finite [[alphabet]] ''A''~~ is ~~inductively defined as follows:~~

	* <math>\scriptstyle h\left(\emptyset\right)\,=\,0</math>, <math>\scriptstyle h\left(\varepsilon\right)\,=\,0</math>, and <math>\scriptstyle h\left(a\right)\,=\,0</math> for all alphabet symbols ''a'' in ''A''.
	* <math>\scriptstyle h\left(E F\right)\,=\, h\left(E\, \mid\, F\right)\,=\,\max \left(\, h(E), h(F)\,\right)</math>
	* <math>\scriptstyle h\left(E^*\right)\,=\,h(E)+1.</math>

	~~Here, <math>\scriptstyle \emptyset</math> is the special regular expression denoting the empty set~~ and ~~ε the special one denoting the [[empty word]];~~
	~~''E'' and ''F'' are arbitrary regular expressions.~~

	~~The star height ''h''(''L'') of a regular language ''L'' is defined as the minimum star height among all regular expressions representing ''L''.~~
	~~The intuition is here that if the language ''L'' has large star height, then it is in some sense inherently complex, since it cannot be described~~
	~~by means of an "easy" regular expression, of low star height.~~

	~~==Examples==~~
	~~While computing the star height of a regular expression is easy, determining the star height of a language can be sometimes tricky.~~
	~~For illustration, the regular expression~~
	~~<!--:''(b ∪ aa<sup></sup>b)<sup></sup>aa<sup>*</sup>''-->~~
	~~:<math>\scriptstyle \left(b\, \mid\, a a^b\right)^a a^* </math>~~
	~~over the alphabet ''A = {a,b}''~~
	~~has star height 2. However, the described language~~ is ~~just the set of all words ending in an ''a'': thus the language can also be described by the expression~~
	~~<!--:''(a∪b)<sup>*</sup>a'',-->~~
	~~:<math>\scriptstyle (a\, \mid\, b)^*a</math>~~
	~~which is only of star height 1. To prove that this language indeed has star height 1, one still needs~~ to ~~rule out that~~ it ~~could be described by a regular~~
	~~expression of lower star height. For our example, this can be done by an indirect proof: One proves that a language of star height 0~~
	~~contains only finitely many words~~. ~~Since the language under consideration~~ is ~~infinite, it cannot be of star height 0.~~

	~~The star height of a [[group language]] is computable: for example, the star height of the language over {''a'',''b''}~~ in ~~which the number of occurrences of ''a'' and ''b'' are congruent modulo 2<sup>''n''</sup> is ''n''.<ref name=Sak342>Sakarovitch (2009) p.342</ref>~~

	~~==Eggan's theorem==~~
	In his seminal study of the star height of regular languages, {{harvtxt\|Eggan\|1963}} established a relation between the theories of regular expressions, finite automata, and of [[directed graph]]s. In subsequent years, this relation became known as ''Eggan's theorem'', cf. {{harvtxt\|Sakarovitch\|2009}}. We recall a few concepts from [[graph theory]] and ~~[[automata theory]]~~.

	~~In graph theory, the [[cycle rank]] ''r''(''G'') of a directed graph ''G'' = (''V'', ''E'') is inductively defined as follows:~~
	* If ''G'' is acyclic, then ''r''(''G'') = 0.
	* If ''G'' is strongly connected and ''E'' is nonempty, then
	~~::<math>r(G) = 1 + \min_{v\~~in ~~V} r(G-v),\,</math>{{pad\|4em}}where G - v is the digraph resulting from deletion of vertex v~~ and ~~all edges beginning or ending at v.~~
	* If ''G'' is not strongly connected, then ''r''(''G'') is equal to the maximum cycle rank among all strongly connected components of ''G''.

	In automata theory, a [[nondeterministic finite automaton]] [[nondeterministic finite automaton#Variations of NFA\|with ε-moves]] (ε-NFA) is defined as a [[n-tuple\|5-tuple]], (''Q'', Σ, ''δ'', ''q<sub>0</sub>'', ''F''), consisting of
	* a finite [[Set (mathematics)\|set]] of states ''Q''
	* a finite set of [[input symbol]]s Σ
	* a set of labeled edges ''δ'', referred to as ''transition relation'': ''Q'' × (Σ ∪{ε}) × ''Q''. Here ε denotes the [[empty word]].
	* an ''initial'' state ''q''<sub>0</sub> ∈ ''Q''
	* a set of states ''F'' distinguished as ''accepting states'' ''F'' ⊆ ''Q''.
	A word ''w'' ∈ Σ<sup></sup> is accepted by the ε-NFA if there exists a [[directed path]] from the initial state ''q''<sub>0</sub> to some final state in ''F'' using edges from ''δ'', such that the [[concatenation]] of all labels visited along the path yields the word ''w''. ~~The set of all words over Σ~~<~~sup~~><~~/sup~~> ~~accepted by the automaton is the ''language'' accepted by the automaton ''A''.~~

	When speaking of digraph properties of a nondeterministic finite automaton ''A'' with state set ''Q'', we naturally address the digraph with vertex set ''Q'' induced by its transition relation. Now the theorem is stated as follows.

	:~~'''Eggan's Theorem'''~~: The star height of a regular language ''L'' equals the minimum [[cycle rank]] among all [[nondeterministic finite automaton]]s [[nondeterministic finite automaton#Variations of NFA\|with ε-moves]] accepting ''L''.

	~~Proofs of this theorem are given by {{harvtxt\|Eggan\|1963}}, and more recently by {{harvtxt\|Sakarovitch\|2009}}.~~

	~~==Generalized star height==~~
	~~The above definition assumes that regular expressions are built from the elements of the alphabet ''A''~~
	~~using only the standard operators [[set union]], [[concatenation]], and [[Kleene star]]. ''Generalized regular expressions'' are defined just as regular expressions, but here also the~~ [~~[set complement]] operator is allowed~~
	~~(the complement is always taken with respect to the set of all words over A). If we alter the definition such that taking complements does not increase the star height, that is,~~

	~~:<math>\scriptstyle h\left(E^c\right)\,=\,h(E)</math>~~

	~~we can define the '''generalized star height''' of a regular language ''L'' as the minimum star height among all ''generalized'' regular expressions~~
	~~representing ''L''.~~

	~~Note that, whereas it is immediate that a language of (ordinary) star height 0 can contain only finitely many words, there exist infinite~~
	~~languages having generalized star height 0. For instance, the regular expression~~
	~~:<math>\scriptstyle (a\, \mid\, b)^*a,</math>~~
	~~which we saw in the example above, can be equivalently described by the generalized regular expression~~
	:~~<math>\scriptstyle \emptyset^c a</math>,~~
	~~since the complement of the empty set is precisely the set of all words over ''A''. Thus the set of all words over the alphabet ''A'' ending in the letter ''a'' has star height one, while its~~
	~~generalized star height equals zero.~~

	Languages of generalized star height zero are also called [[star-free language]]s. It can be shown that a language ''L'' is star-free if and only if its [[syntactic monoid]] is [[aperiodic monoid\|aperiodic]] ({{harvtxt\|Schützenberger\|1965}}).

	~~==See also==~~
	*[[Star height problem]]
	*[[Generalized star height problem]].

	~~==References==~~
	~~{{reflist}}~~
	* {{ Citation \| first=Lawrence C. \|last=Eggan \|title=Transition graphs and the star-height of regular events \| journal=[[Michigan Mathematical Journal]] \| volume=10 \| issue=4 \| pages= 385–397 \| year= 1963 \| doi=10.1307/mmj/~~1028998975 }}~~
	* {{Citation \| author=Schützenberger M.P. \|authorlink=Marcel-Paul Schützenberger \| title=On finite monoids having only trivial subgroups \| journal=[[Information and Control]]\| year=1965\| volume=8 \| issue=2 \| pages=190–194 \| doi=10.1016/S0019-9958(65)90108-7 \| zbl=0131.02001 \| issn=0019-9958 }}
	* {{Citation \| last=Cohen \| first=Rina S. \| title=Techniques for establishing star height of regular sets \| journal=[[Theory of Computing Systems]] \| issn=1432-4350 \| volume=5 \| issue=2 \|year=1971 \|doi=10.1007/~~BF01702866 \| pages=97–114 \| zbl=0218~~.~~94028 }}~~
	* {{Citation \| journal=[[Journal of Computer and System Sciences]] \| volume= 4 \| issue=3 \| year=1970 \| pages= 260–280 \| doi=10.1016/~~S0022-0000(70)80024-1 \| title=General properties of star height of regular events\| first1=Rina S. \|last1=Cohen \| first2=J.A. \|last2=Brzozowski \| zbl=0245~~.~~94038\| issn=0022-0000 }}~~
	* {{Citation \| last=Sakarovitch \| first=Jacques \| title=Elements of automata theory \| others=Translated from the French by Reuben Thomas \| location=Cambridge \| publisher=~~[[Cambridge University Press]] \| year=2009 \| isbn=978-0-521-84425-3 \| zbl=1188~~.~~68177 }}~~
	* {{Citation \| zbl=0487.68064 \| last=Salomaa \| first=Arto \| authorlink=Arto Salomaa \| title=Jewels of formal language theory \| location=Rockville, Maryland \| publisher=Computer Science Press \| year=1981 \| isbn=0-914894-69-2 }}

	~~[[Category:Formal languages]~~]

en>Monkbot: /* Clusters and clusterings */Fix CS1 deprecated date parameter errors

2014-02-03T22:56:50Z

Clusters and clusterings: Fix CS1 deprecated date parameter errors

← Older revision		Revision as of 00:56, 4 February 2014
Line 1:		Line 1:
	~~Name~~: ~~Robbie Overton~~<br>~~My age~~: 25 years ~~old~~<br>~~Country~~: ~~Australia~~<br>~~Town~~: ~~Taggerty~~ <br>~~Post code~~: ~~3714~~<br>~~Street~~: ~~95 Harris Street~~<br><br>~~Review my site~~ [~~http:~~//~~legaladviceindia~~.~~com~~/~~content~~/~~learn~~-~~about~~-~~college~~-~~article~~-~~bookbyte~~-~~promo Bookbyte Promo Code November 2014~~]		In [[theoretical computer science]], more precisely in the theory of [[formal languages]], the '''star height''' is a measure for the structural complexity
			of [[Regular_expression#Formal_language_theory\|regular expressions]]: The star height equals the maximum nesting depth of stars appearing in the regular expression.
			The concept of star height was first defined and studied by Eggan (1963).

			==Formal definition==
			More formally, the star height of a [[Regular_expression#Formal_language_theory\|regular expression]]
			''E'' over a finite [[alphabet]] ''A'' is inductively defined as follows:

			* <math>\scriptstyle h\left(\emptyset\right)\,=\,0</math>, <math>\scriptstyle h\left(\varepsilon\right)\,=\,0</math>, and <math>\scriptstyle h\left(a\right)\,=\,0</math> for all alphabet symbols ''a'' in ''A''.
			* <math>\scriptstyle h\left(E F\right)\,=\, h\left(E\, \mid\, F\right)\,=\,\max \left(\, h(E), h(F)\,\right)</math>
			* <math>\scriptstyle h\left(E^*\right)\,=\,h(E)+1.</math>

			Here, <math>\scriptstyle \emptyset</math> is the special regular expression denoting the empty set and ε the special one denoting the [[empty word]];
			''E'' and ''F'' are arbitrary regular expressions.

			The star height ''h''(''L'') of a regular language ''L'' is defined as the minimum star height among all regular expressions representing ''L''.
			The intuition is here that if the language ''L'' has large star height, then it is in some sense inherently complex, since it cannot be described
			by means of an "easy" regular expression, of low star height.

			==Examples==
			While computing the star height of a regular expression is easy, determining the star height of a language can be sometimes tricky.
			For illustration, the regular expression
			<!--:''(b ∪ aa<sup></sup>b)<sup></sup>aa<sup>*</sup>''-->
			:<math>\scriptstyle \left(b\, \mid\, a a^b\right)^a a^* </math>
			over the alphabet ''A = {a,b}''
			has star height 2. However, the described language is just the set of all words ending in an ''a'': thus the language can also be described by the expression
			<!--:''(a∪b)<sup>*</sup>a'',-->
			:<math>\scriptstyle (a\, \mid\, b)^*a</math>
			which is only of star height 1. To prove that this language indeed has star height 1, one still needs to rule out that it could be described by a regular
			expression of lower star height. For our example, this can be done by an indirect proof: One proves that a language of star height 0
			contains only finitely many words. Since the language under consideration is infinite, it cannot be of star height 0.

			The star height of a [[group language]] is computable: for example, the star height of the language over {''a'',''b''} in which the number of occurrences of ''a'' and ''b'' are congruent modulo 2<sup>''n''</sup> is ''n''.<ref name=Sak342>Sakarovitch (2009) p.342</ref>

			==Eggan's theorem==
			In his seminal study of the star height of regular languages, {{harvtxt\|Eggan\|1963}} established a relation between the theories of regular expressions, finite automata, and of [[directed graph]]s. In subsequent years, this relation became known as ''Eggan's theorem'', cf. {{harvtxt\|Sakarovitch\|2009}}. We recall a few concepts from [[graph theory]] and [[automata theory]].

			In graph theory, the [[cycle rank]] ''r''(''G'') of a directed graph ''G'' = (''V'', ''E'') is inductively defined as follows:
			* If ''G'' is acyclic, then ''r''(''G'') = 0.
			* If ''G'' is strongly connected and ''E'' is nonempty, then
			::<math>r(G) = 1 + \min_{v\in V} r(G-v),\,</math>{{pad\|4em}}where G - v is the digraph resulting from deletion of vertex v and all edges beginning or ending at v.
			* If ''G'' is not strongly connected, then ''r''(''G'') is equal to the maximum cycle rank among all strongly connected components of ''G''.

			In automata theory, a [[nondeterministic finite automaton]] [[nondeterministic finite automaton#Variations of NFA\|with ε-moves]] (ε-NFA) is defined as a [[n-tuple\|5-tuple]], (''Q'', Σ, ''δ'', ''q<sub>0</sub>'', ''F''), consisting of
			* a finite [[Set (mathematics)\|set]] of states ''Q''
			* a finite set of [[input symbol]]s Σ
			* a set of labeled edges ''δ'', referred to as ''transition relation'': ''Q'' × (Σ ∪{ε}) × ''Q''. Here ε denotes the [[empty word]].
			* an ''initial'' state ''q''<sub>0</sub> ∈ ''Q''
			* a set of states ''F'' distinguished as ''accepting states'' ''F'' ⊆ ''Q''.
			A word ''w'' ∈ Σ<sup></sup> is accepted by the ε-NFA if there exists a [[directed path]] from the initial state ''q''<sub>0</sub> to some final state in ''F'' using edges from ''δ'', such that the [[concatenation]] of all labels visited along the path yields the word ''w''. The set of all words over Σ<sup></sup> accepted by the automaton is the ''language'' accepted by the automaton ''A''.

			When speaking of digraph properties of a nondeterministic finite automaton ''A'' with state set ''Q'', we naturally address the digraph with vertex set ''Q'' induced by its transition relation. Now the theorem is stated as follows.

			:'''Eggan's Theorem''': The star height of a regular language ''L'' equals the minimum [[cycle rank]] among all [[nondeterministic finite automaton]]s [[nondeterministic finite automaton#Variations of NFA\|with ε-moves]] accepting ''L''.

			Proofs of this theorem are given by {{harvtxt\|Eggan\|1963}}, and more recently by {{harvtxt\|Sakarovitch\|2009}}.

			==Generalized star height==
			The above definition assumes that regular expressions are built from the elements of the alphabet ''A''
			using only the standard operators [[set union]], [[concatenation]], and [[Kleene star]]. ''Generalized regular expressions'' are defined just as regular expressions, but here also the [[set complement]] operator is allowed
			(the complement is always taken with respect to the set of all words over A). If we alter the definition such that taking complements does not increase the star height, that is,

			:<math>\scriptstyle h\left(E^c\right)\,=\,h(E)</math>

			we can define the '''generalized star height''' of a regular language ''L'' as the minimum star height among all ''generalized'' regular expressions
			representing ''L''.

			Note that, whereas it is immediate that a language of (ordinary) star height 0 can contain only finitely many words, there exist infinite
			languages having generalized star height 0. For instance, the regular expression
			:<math>\scriptstyle (a\, \mid\, b)^*a,</math>
			which we saw in the example above, can be equivalently described by the generalized regular expression
			:<math>\scriptstyle \emptyset^c a</math>,
			since the complement of the empty set is precisely the set of all words over ''A''. Thus the set of all words over the alphabet ''A'' ending in the letter ''a'' has star height one, while its
			generalized star height equals zero.

			Languages of generalized star height zero are also called [[star-free language]]s. It can be shown that a language ''L'' is star-free if and only if its [[syntactic monoid]] is [[aperiodic monoid\|aperiodic]] ({{harvtxt\|Schützenberger\|1965}}).

			==See also==
			*[[Star height problem]]
			*[[Generalized star height problem]].

			==References==
			{{reflist}}
			* {{ Citation \| first=Lawrence C. \|last=Eggan \|title=Transition graphs and the star-height of regular events \| journal=[[Michigan Mathematical Journal]] \| volume=10 \| issue=4 \| pages= 385–397 \| year= 1963 \| doi=10.1307/mmj/1028998975 }}
			* {{Citation \| author=Schützenberger M.P. \|authorlink=Marcel-Paul Schützenberger \| title=On finite monoids having only trivial subgroups \| journal=[[Information and Control]]\| year=1965\| volume=8 \| issue=2 \| pages=190–194 \| doi=10.1016/S0019-9958(65)90108-7 \| zbl=0131.02001 \| issn=0019-9958 }}
			* {{Citation \| last=Cohen \| first=Rina S. \| title=Techniques for establishing star height of regular sets \| journal=[[Theory of Computing Systems]] \| issn=1432-4350 \| volume=5 \| issue=2 \|year=1971 \|doi=10.1007/BF01702866 \| pages=97–114 \| zbl=0218.94028 }}
			* {{Citation \| journal=[[Journal of Computer and System Sciences]] \| volume= 4 \| issue=3 \| year=1970 \| pages= 260–280 \| doi=10.1016/S0022-0000(70)80024-1 \| title=General properties of star height of regular events\| first1=Rina S. \|last1=Cohen \| first2=J.A. \|last2=Brzozowski \| zbl=0245.94038\| issn=0022-0000 }}
			* {{Citation \| last=Sakarovitch \| first=Jacques \| title=Elements of automata theory \| others=Translated from the French by Reuben Thomas \| location=Cambridge \| publisher=[[Cambridge University Press]] \| year=2009 \| isbn=978-0-521-84425-3 \| zbl=1188.68177 }}
			* {{Citation \| zbl=0487.68064 \| last=Salomaa \| first=Arto \| authorlink=Arto Salomaa \| title=Jewels of formal language theory \| location=Rockville, Maryland \| publisher=Computer Science Press \| year=1981 \| isbn=0-914894-69-2 }}

			[[Category:Formal languages]]

en>Mcld: /* Newer developments */ wikilink

2012-08-22T09:33:48Z

Newer developments: wikilink

New page

Name: Robbie Overton My age: 25 years old Country: Australia Town: Taggerty Post code: 3714 Street: 95 Harris Street Review my site [http://legaladviceindia.com/content/learn-about-college-article-bookbyte-promo Bookbyte Promo Code November 2014]