DKA minimizacija — разлика између измена
Нема описа измене |
. |
||
Ред 1: | Ред 1: | ||
Pod '''DKA minimizacijom''' se podrazumeva nalaženje [[Deterministički konačni automat|determinističkog konačnog automata]] ('''DKA''') |
Pod '''DKA minimizacijom''' se podrazumeva nalaženje [[Deterministički konačni automat|determinističkog konačnog automata]] ('''DKA''') |
||
sa najmanjim brojem stanja koji prepoznaje isti regularan jezik kao i zadati DKA. Pokazuje se da je ovaj |
sa najmanjim brojem stanja koji prepoznaje isti regularan jezik kao i zadati DKA.<ref>{{harvtxt|Hopcroft|Motwani|Ullman|2001}}, Section 4.4.3, "Minimization of DFA's".</ref> Pokazuje se da je ovaj automat jedinstven do na izomorfizam! Naime, za dva ''DKA'' <math> \mathcal{A} = (\Sigma, Q, i, F, \delta) </math> i <math> \mathcal{B} = (\Sigma, Q', i', F', \delta{}') </math> kažemo da su izomorfni ukoliko postoji bijekcija <math>f: Q \to Q'</math> tako da je zadovoljeno :<br /> |
||
automat jedinstven do na izomorfizam! Naime, za dva ''DKA'' |
|||
<math> \mathcal{A} = (\Sigma, Q, i, F, \delta) </math> i <math> \mathcal{B} = (\Sigma, Q', i', F', \delta{}') </math> |
|||
kažemo da su izomorfni ukoliko postoji bijekcija <math>f: Q \to Q'</math> tako da je zadovoljeno :<br /> |
|||
# <math>f(i) = i'</math> |
# <math>f(i) = i'</math> |
||
Ред 22: | Ред 19: | ||
biće izložen skelet teorije koja se tiče minimalnog automata, a zatim će biti izloženo |
biće izložen skelet teorije koja se tiče minimalnog automata, a zatim će biti izloženo |
||
nekoliko algoritama za konstrukciju MDKA uz detaljna objašnjenja. |
nekoliko algoritama za konstrukciju MDKA uz detaljna objašnjenja. |
||
== Minimalni automat preko levih količnika== |
== Minimalni automat preko levih količnika== |
||
Ред 29: | Ред 25: | ||
* Za <math> u \in \Sigma^{*} </math> definišemo <math>u^{-1}X = \{w \in \Sigma^{*} : uw \in X\}</math> gde <math> X \subset \Sigma^{*} </math>(Levi količnik skupa <math> X </math> po reči <math> u </math>) |
* Za <math> u \in \Sigma^{*} </math> definišemo <math>u^{-1}X = \{w \in \Sigma^{*} : uw \in X\}</math> gde <math> X \subset \Sigma^{*} </math>(Levi količnik skupa <math> X </math> po reči <math> u </math>) |
||
* Definišemo i <math> Q(L) = \{u^{-1}L : u \in \Sigma^{*}\} </math> |
* Definišemo i <math> Q(L) = \{u^{-1}L : u \in \Sigma^{*}\} </math> |
||
== Reference == |
|||
{{reflist}} |
|||
== Literatura == |
|||
{{refbegin|2}} |
|||
*{{citation|pages=157–162|chapter=4.13 Partitioning|title=The Design and Analysis of Computer Algorithms|first1=Alfred V.|last1=Aho|author1-link=Alfred Aho|first2=John E.|last2=Hopcroft|author2-link=John Hopcroft|first3=Jeffrey D.|last3=Ullman|author3-link=Jeffrey D. Ullman|publisher=Addison-Wesley|year=1974}}. |
|||
*{{citation | first1=Jean | last1=Berstel | first2=Luc | last2=Boasson | first3=Olivier | last3=Carton | first4=Isabelle | last4=Fagnot | contribution=Minimization of Automata | arxiv=1010.5318 | year=2010 | title=Automata: from Mathematics to Applications|publisher=European Mathematical Society }} |
|||
*{{citation |
|||
| last = Brzozowski | first = J. A. |
|||
| authorlink=Janusz Brzozowski (computer scientist) |
|||
| contribution = Canonical regular expressions and minimal state graphs for definite events |
|||
| mr = 0175719 |
|||
| pages = 529–561 |
|||
| publisher = Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn, N.Y. |
|||
| title = Proc. Sympos. Math. Theory of Automata (New York, 1962) |
|||
| year = 1963}}. |
|||
*{{citation |
|||
| last1 = Câmpeanu | first1 = Cezar |
|||
| last2 = Culik | first2 = Karel, II |
|||
| last3 = Salomaa | first3 = Kai |
|||
| last4 = Yu | first4 = Sheng |
|||
| contribution = State Complexity of Basic Operations on Finite Languages |
|||
| doi = 10.1007/3-540-45526-4_6 |
|||
| pages = 60–70 |
|||
| publisher = Springer-Verlag |
|||
| series = Lecture Notes in Computer Science |
|||
| title = 4th International Workshop on Automata Implementation (WIA '99) |
|||
| volume = 2214 |
|||
| year = 2001}}. |
|||
*{{citation |title=Average complexity of Moore’s and Hopcroft’s algorithms |first=Julien |last=David |year=2012 |journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]]|volume=417 |pages=50–65 |doi=10.1016/j.tcs.2011.10.011}}. |
|||
*{{citation |
|||
| last = Hopcroft | first = John | authorlink = John Hopcroft |
|||
| contribution = An {{math|''n'' log ''n''}} algorithm for minimizing states in a finite automaton |
|||
| mr = 0403320 |
|||
| location = New York |
|||
| pages = 189–196 |
|||
| publisher = Academic Press |
|||
| title = Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971) |
|||
| year = 1971}}. See also preliminary version, [http://i.stanford.edu/pub/cstr/reports/cs/tr/71/190/CS-TR-71-190.pdf Technical Report STAN-CS-71-190], Stanford University, Computer Science Department, January 1971. |
|||
*{{citation|title=[[Introduction to Automata Theory, Languages, and Computation]] | last1 = Hopcroft | first1 = John E. | author1-link = John Hopcroft | last2 = Motwani | first2 = Rajeev | author2-link = Rajeev Motwani | last3 = Ullman | first3 = Jeffrey D. | author3-link = Jeffrey D. Ullman | publisher = Addison-Wesley | edition = 2nd | year = 2001}}. |
|||
*{{citation |
|||
| last1 = Kameda | first1 = Tsunehiko |
|||
| last2 = Weiner | first2 = Peter |
|||
| doi = 10.1109/T-C.1970.222994 |
|||
| issue = 7 |
|||
| journal = IEEE Transactions on Computers |
|||
| title = On the state minimization of nondeterministic finite automata |
|||
| volume = 100 |
|||
| year = 1970}}. |
|||
*{{citation |
|||
| last = Knuutila | first = Timo |
|||
| doi = 10.1016/S0304-3975(99)00150-4 |
|||
| issue = 1-2 |
|||
| journal = Theoretical Computer Science |
|||
| mr = 1795249 |
|||
| pages = 333–363 |
|||
| title = Re-describing an algorithm by Hopcroft |
|||
| volume = 250 |
|||
| year = 2001}}. |
|||
*{{citation |
|||
| last = Leiss | first = Ernst |
|||
| doi = 10.1016/S0304-3975(81)80005-9 |
|||
| mr = 603263 |
|||
| issue = 3 |
|||
| journal = Theoretical Computer Science |
|||
| pages = 323–330 |
|||
| title = Succinct representation of regular languages by Boolean automata |
|||
| volume = 13 |
|||
| url = http://www.sciencedirect.com/science/article/pii/S0304397581800059/pdf?md5=ae550d58084acf5f9af3fac6b8b20106&pid=1-s2.0-S0304397581800059-main.pdf |
|||
| year = 1981}}. |
|||
*{{citation | last = Leiss | first = Ernst | title=Succinct representation of regular languages by Boolean automata II | journal=Theoretical Computer Science | volume=38 | number= | pages=133–136 | url=http://www.sciencedirect.com/science/article/pii/0304397585902154/pdf?md5=00582bb1bdc5f7a3af33b8c19479d3d3&pid=1-s2.0-0304397585902154-main.pdf | year=1985 | doi=10.1016/0304-3975(85)90215-4}} |
|||
*{{citation |
|||
| last = Moore | first = Edward F. | authorlink = Edward F. Moore |
|||
| contribution = Gedanken-experiments on sequential machines |
|||
| mr = 0078059 |
|||
| location = Princeton, N. J. |
|||
| pages = 129–153 |
|||
| publisher = Princeton University Press |
|||
| series = Annals of mathematics studies, no. 34 |
|||
| title = Automata studies |
|||
| year = 1956}}. |
|||
* {{citation | last=Sakarovitch | first=Jacques | title=Elements of automata theory | others=Translated from the French by Reuben Thomas | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-84425-3 | zbl=1188.68177 }} |
|||
{{refend}} |
|||
== Spoljašnje veze == |
|||
* [http://www.cs.umu.se/kurser/TDBC92/VT06/final/1.pdf DFA minimization using the Myhill-Nerode theorem] |
Верзија на датум 5. фебруар 2017. у 17:50
Pod DKA minimizacijom se podrazumeva nalaženje determinističkog konačnog automata (DKA)
sa najmanjim brojem stanja koji prepoznaje isti regularan jezik kao i zadati DKA.[1] Pokazuje se da je ovaj automat jedinstven do na izomorfizam! Naime, za dva DKA i kažemo da su izomorfni ukoliko postoji bijekcija tako da je zadovoljeno :
Neformalno govoreći, ovo zapravo znači da ako imamo iscrtan multigraf kojim je predstavljen automat ,
možemo preimenovati stanja tog grafa (ostavljajući grane netaknutim i ne uvodeći nova početna niti završna
stanja ) tako da se dobije multigraf automata . Dakle pri minimizaciji
ne možemo dobiti suštinski različite automate i time se rešava pitanje jedinstvenosti.
U daljem izlaganju koristićemo mestimično i proiširenu funkciju prelaza
gde , koja se definiše ovako:
- kada
- gde je neka reč: i
U narednim sekcijama biće izložen skelet teorije koja se tiče minimalnog automata, a zatim će biti izloženo nekoliko algoritama za konstrukciju MDKA uz detaljna objašnjenja.
Minimalni automat preko levih količnika
Neka je dat regularan jezik nad azbukom .
- Tada postoji neki DKA koji ga prepoznaje, odnosno .
- Za definišemo gde (Levi količnik skupa po reči )
- Definišemo i
Reference
- ^ Hopcroft, Motwani & Ullman (2001), Section 4.4.3, "Minimization of DFA's".
Literatura
- Aho, Alfred V.; Hopcroft, John E.; Ullman, Jeffrey D. (1974), „4.13 Partitioning”, The Design and Analysis of Computer Algorithms, Addison-Wesley, стр. 157—162.
- Berstel, Jean; Boasson, Luc; Carton, Olivier; Fagnot, Isabelle (2010), „Minimization of Automata”, Automata: from Mathematics to Applications, European Mathematical Society, arXiv:1010.5318
- Brzozowski, J. A. (1963), „Canonical regular expressions and minimal state graphs for definite events”, Proc. Sympos. Math. Theory of Automata (New York, 1962), Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn, N.Y., стр. 529—561, MR 0175719.
- Câmpeanu, Cezar; Culik, Karel, II; Salomaa, Kai; Yu, Sheng (2001), „State Complexity of Basic Operations on Finite Languages”, 4th International Workshop on Automata Implementation (WIA '99), Lecture Notes in Computer Science, 2214, Springer-Verlag, стр. 60—70, doi:10.1007/3-540-45526-4_6.
- David, Julien (2012), „Average complexity of Moore’s and Hopcroft’s algorithms”, Theoretical Computer Science, 417: 50—65, doi:10.1016/j.tcs.2011.10.011.
- Hopcroft, John (1971), „An n log n algorithm for minimizing states in a finite automaton”, Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971), New York: Academic Press, стр. 189—196, MR 0403320. See also preliminary version, Technical Report STAN-CS-71-190, Stanford University, Computer Science Department, January 1971.
- Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2001), Introduction to Automata Theory, Languages, and Computation (2nd изд.), Addison-Wesley.
- Kameda, Tsunehiko; Weiner, Peter (1970), „On the state minimization of nondeterministic finite automata”, IEEE Transactions on Computers, 100 (7), doi:10.1109/T-C.1970.222994.
- Knuutila, Timo (2001), „Re-describing an algorithm by Hopcroft”, Theoretical Computer Science, 250 (1-2): 333—363, MR 1795249, doi:10.1016/S0304-3975(99)00150-4.
- Leiss, Ernst (1981), „Succinct representation of regular languages by Boolean automata” (PDF), Theoretical Computer Science, 13 (3): 323—330, MR 603263, doi:10.1016/S0304-3975(81)80005-9.
- Leiss, Ernst (1985), „Succinct representation of regular languages by Boolean automata II” (PDF), Theoretical Computer Science, 38: 133—136, doi:10.1016/0304-3975(85)90215-4
- Moore, Edward F. (1956), „Gedanken-experiments on sequential machines”, Automata studies, Annals of mathematics studies, no. 34, Princeton, N. J.: Princeton University Press, стр. 129—153, MR 0078059.
- Sakarovitch, Jacques (2009), Elements of automata theory, Translated from the French by Reuben Thomas, Cambridge University Press, ISBN 978-0-521-84425-3, Zbl 1188.68177