A geometrical view of the determinization and minimization of finite-state automata

Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Courcelle, Bruno [verfasserIn] Niwinski, Damian Podelski, Andreas

Format:	Artikel
Sprache:	Englisch

Erschienen:	1991

Schlagwörter:	Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View

Systematik:	SA 6845 SA 6845

Anmerkung:	© Springer-Verlag New York Inc. 1991

Übergeordnetes Werk:	Enthalten in: Mathematical systems theory - Springer-Verlag, 1967, 24(1991), 1 vom: Dez., Seite 117-146
Übergeordnetes Werk:	volume:24 ; year:1991 ; number:1 ; month:12 ; pages:117-146

Links:	Volltext

DOI / URN:	10.1007/BF02090394

Katalog-ID:	OLC2061911471

Internformat


LEADER	01000caa a22002652 4500
001	OLC2061911471
003	DE-627
005	20230323224406.0
007	tu
008	200819s1991 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/BF02090394 \|2 doi
035			\|a (DE-627)OLC2061911471
035			\|a (DE-He213)BF02090394-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 510 \|a 000 \|q VZ
084			\|a SA 6845 \|q VZ \|2 rvk
084			\|a SA 6845 \|q VZ \|2 rvk
100	1		\|a Courcelle, Bruno \|e verfasserin \|4 aut
245	1	0	\|a A geometrical view of the determinization and minimization of finite-state automata
264		1	\|c 1991
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
500			\|a © Springer-Verlag New York Inc. 1991
520			\|a Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations.
650		4	\|a Computational Mathematic
650		4	\|a Binary Relation
650		4	\|a Finite Union
650		4	\|a Tree Automaton
650		4	\|a Geometrical View
700	1		\|a Niwinski, Damian \|4 aut
700	1		\|a Podelski, Andreas \|4 aut
773	0	8	\|i Enthalten in \|t Mathematical systems theory \|d Springer-Verlag, 1967 \|g 24(1991), 1 vom: Dez., Seite 117-146 \|w (DE-627)129081450 \|w (DE-600)3459-9 \|w (DE-576)014414325 \|x 0025-5661 \|7 nnns
773	1	8	\|g volume:24 \|g year:1991 \|g number:1 \|g month:12 \|g pages:117-146
856	4	1	\|u https://doi.org/10.1007/BF02090394 \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-MAT
912			\|a SSG-OPC-MAT
912			\|a GBV_ILN_11
912			\|a GBV_ILN_21
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_30
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_70
912			\|a GBV_ILN_105
912			\|a GBV_ILN_2002
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2012
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4029
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4103
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4314
912			\|a GBV_ILN_4316
912			\|a GBV_ILN_4317
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4700
936	r	v	\|a SA 6845
936	r	v	\|a SA 6845
951			\|a AR
952			\|d 24 \|j 1991 \|e 1 \|c 12 \|h 117-146

Indexfelder

author_variant	b c bc d n dn a p ap
matchkey_str	article:00255661:1991----::goercliwfhdtriiainnmnmztoof
hierarchy_sort_str	1991
publishDate	1991
allfields	10.1007/BF02090394 doi (DE-627)OLC2061911471 (DE-He213)BF02090394-p DE-627 ger DE-627 rakwb eng 510 000 VZ SA 6845 VZ rvk SA 6845 VZ rvk Courcelle, Bruno verfasserin aut A geometrical view of the determinization and minimization of finite-state automata 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1991 Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View Niwinski, Damian aut Podelski, Andreas aut Enthalten in Mathematical systems theory Springer-Verlag, 1967 24(1991), 1 vom: Dez., Seite 117-146 (DE-627)129081450 (DE-600)3459-9 (DE-576)014414325 0025-5661 nnns volume:24 year:1991 number:1 month:12 pages:117-146 https://doi.org/10.1007/BF02090394 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_105 GBV_ILN_2002 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4700 SA 6845 SA 6845 AR 24 1991 1 12 117-146
spelling	10.1007/BF02090394 doi (DE-627)OLC2061911471 (DE-He213)BF02090394-p DE-627 ger DE-627 rakwb eng 510 000 VZ SA 6845 VZ rvk SA 6845 VZ rvk Courcelle, Bruno verfasserin aut A geometrical view of the determinization and minimization of finite-state automata 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1991 Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View Niwinski, Damian aut Podelski, Andreas aut Enthalten in Mathematical systems theory Springer-Verlag, 1967 24(1991), 1 vom: Dez., Seite 117-146 (DE-627)129081450 (DE-600)3459-9 (DE-576)014414325 0025-5661 nnns volume:24 year:1991 number:1 month:12 pages:117-146 https://doi.org/10.1007/BF02090394 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_105 GBV_ILN_2002 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4700 SA 6845 SA 6845 AR 24 1991 1 12 117-146
allfields_unstemmed	10.1007/BF02090394 doi (DE-627)OLC2061911471 (DE-He213)BF02090394-p DE-627 ger DE-627 rakwb eng 510 000 VZ SA 6845 VZ rvk SA 6845 VZ rvk Courcelle, Bruno verfasserin aut A geometrical view of the determinization and minimization of finite-state automata 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1991 Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View Niwinski, Damian aut Podelski, Andreas aut Enthalten in Mathematical systems theory Springer-Verlag, 1967 24(1991), 1 vom: Dez., Seite 117-146 (DE-627)129081450 (DE-600)3459-9 (DE-576)014414325 0025-5661 nnns volume:24 year:1991 number:1 month:12 pages:117-146 https://doi.org/10.1007/BF02090394 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_105 GBV_ILN_2002 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4700 SA 6845 SA 6845 AR 24 1991 1 12 117-146
allfieldsGer	10.1007/BF02090394 doi (DE-627)OLC2061911471 (DE-He213)BF02090394-p DE-627 ger DE-627 rakwb eng 510 000 VZ SA 6845 VZ rvk SA 6845 VZ rvk Courcelle, Bruno verfasserin aut A geometrical view of the determinization and minimization of finite-state automata 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1991 Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View Niwinski, Damian aut Podelski, Andreas aut Enthalten in Mathematical systems theory Springer-Verlag, 1967 24(1991), 1 vom: Dez., Seite 117-146 (DE-627)129081450 (DE-600)3459-9 (DE-576)014414325 0025-5661 nnns volume:24 year:1991 number:1 month:12 pages:117-146 https://doi.org/10.1007/BF02090394 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_105 GBV_ILN_2002 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4700 SA 6845 SA 6845 AR 24 1991 1 12 117-146
allfieldsSound	10.1007/BF02090394 doi (DE-627)OLC2061911471 (DE-He213)BF02090394-p DE-627 ger DE-627 rakwb eng 510 000 VZ SA 6845 VZ rvk SA 6845 VZ rvk Courcelle, Bruno verfasserin aut A geometrical view of the determinization and minimization of finite-state automata 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1991 Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View Niwinski, Damian aut Podelski, Andreas aut Enthalten in Mathematical systems theory Springer-Verlag, 1967 24(1991), 1 vom: Dez., Seite 117-146 (DE-627)129081450 (DE-600)3459-9 (DE-576)014414325 0025-5661 nnns volume:24 year:1991 number:1 month:12 pages:117-146 https://doi.org/10.1007/BF02090394 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_105 GBV_ILN_2002 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4700 SA 6845 SA 6845 AR 24 1991 1 12 117-146
language	English
source	Enthalten in Mathematical systems theory 24(1991), 1 vom: Dez., Seite 117-146 volume:24 year:1991 number:1 month:12 pages:117-146
sourceStr	Enthalten in Mathematical systems theory 24(1991), 1 vom: Dez., Seite 117-146 volume:24 year:1991 number:1 month:12 pages:117-146
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View
dewey-raw	510
isfreeaccess_bool	false
container_title	Mathematical systems theory
authorswithroles_txt_mv	Courcelle, Bruno @@aut@@ Niwinski, Damian @@aut@@ Podelski, Andreas @@aut@@
publishDateDaySort_date	1991-12-01T00:00:00Z
hierarchy_top_id	129081450
dewey-sort	3510
id	OLC2061911471
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2061911471</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323224406.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1991 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF02090394</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2061911471</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF02090394-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 6845</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 6845</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Courcelle, Bruno</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A geometrical view of the determinization and minimization of finite-state automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1991</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag New York Inc. 1991</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Binary Relation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite Union</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tree Automaton</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometrical View</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Niwinski, Damian</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Podelski, Andreas</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mathematical systems theory</subfield><subfield code="d">Springer-Verlag, 1967</subfield><subfield code="g">24(1991), 1 vom: Dez., Seite 117-146</subfield><subfield code="w">(DE-627)129081450</subfield><subfield code="w">(DE-600)3459-9</subfield><subfield code="w">(DE-576)014414325</subfield><subfield code="x">0025-5661</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:1991</subfield><subfield code="g">number:1</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:117-146</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF02090394</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 6845</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 6845</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">1991</subfield><subfield code="e">1</subfield><subfield code="c">12</subfield><subfield code="h">117-146</subfield></datafield></record></collection>
author	Courcelle, Bruno
spellingShingle	Courcelle, Bruno ddc 510 rvk SA 6845 misc Computational Mathematic misc Binary Relation misc Finite Union misc Tree Automaton misc Geometrical View A geometrical view of the determinization and minimization of finite-state automata
authorStr	Courcelle, Bruno
ppnlink_with_tag_str_mv	@@773@@(DE-627)129081450
format	Article
dewey-ones	510 - Mathematics 000 - Computer science, information & general works
delete_txt_mv	keep
author_role	aut aut aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0025-5661
topic_title	510 000 VZ SA 6845 VZ rvk A geometrical view of the determinization and minimization of finite-state automata Computational Mathematic Binary Relation Finite Union Tree Automaton Geometrical View
topic	ddc 510 rvk SA 6845 misc Computational Mathematic misc Binary Relation misc Finite Union misc Tree Automaton misc Geometrical View
topic_unstemmed	ddc 510 rvk SA 6845 misc Computational Mathematic misc Binary Relation misc Finite Union misc Tree Automaton misc Geometrical View
topic_browse	ddc 510 rvk SA 6845 misc Computational Mathematic misc Binary Relation misc Finite Union misc Tree Automaton misc Geometrical View
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	Mathematical systems theory
hierarchy_parent_id	129081450
dewey-tens	510 - Mathematics 000 - Computer science, knowledge & systems
hierarchy_top_title	Mathematical systems theory
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129081450 (DE-600)3459-9 (DE-576)014414325
title	A geometrical view of the determinization and minimization of finite-state automata
ctrlnum	(DE-627)OLC2061911471 (DE-He213)BF02090394-p
title_full	A geometrical view of the determinization and minimization of finite-state automata
author_sort	Courcelle, Bruno
journal	Mathematical systems theory
journalStr	Mathematical systems theory
lang_code	eng
isOA_bool	false
dewey-hundreds	500 - Science 000 - Computer science, information & general works
recordtype	marc
publishDateSort	1991
contenttype_str_mv	txt
container_start_page	117
author_browse	Courcelle, Bruno Niwinski, Damian Podelski, Andreas
container_volume	24
class	510 000 VZ SA 6845 VZ rvk
format_se	Aufsätze
author-letter	Courcelle, Bruno
doi_str_mv	10.1007/BF02090394
dewey-full	510 000
title_sort	a geometrical view of the determinization and minimization of finite-state automata
title_auth	A geometrical view of the determinization and minimization of finite-state automata
abstract	Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. © Springer-Verlag New York Inc. 1991
abstractGer	Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. © Springer-Verlag New York Inc. 1991
abstract_unstemmed	Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. © Springer-Verlag New York Inc. 1991
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_21 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_30 GBV_ILN_40 GBV_ILN_60 GBV_ILN_70 GBV_ILN_105 GBV_ILN_2002 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4700
container_issue	1
title_short	A geometrical view of the determinization and minimization of finite-state automata
url	https://doi.org/10.1007/BF02090394
remote_bool	false
author2	Niwinski, Damian Podelski, Andreas
author2Str	Niwinski, Damian Podelski, Andreas
ppnlink	129081450
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/BF02090394
up_date	2024-07-04T04:45:09.942Z
_version_	1803622348158402560
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2061911471</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323224406.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1991 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF02090394</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2061911471</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF02090394-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 6845</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 6845</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Courcelle, Bruno</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A geometrical view of the determinization and minimization of finite-state automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1991</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag New York Inc. 1991</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract With every finite-state word or tree automaton, we associate a binary relation on words or trees. We then consider the “rectangular decompositions” of this relation, i.e., the various ways to express it as a finite union of Cartesian products of sets of words or trees, respectively. We show that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Binary Relation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite Union</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tree Automaton</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometrical View</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Niwinski, Damian</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Podelski, Andreas</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Mathematical systems theory</subfield><subfield code="d">Springer-Verlag, 1967</subfield><subfield code="g">24(1991), 1 vom: Dez., Seite 117-146</subfield><subfield code="w">(DE-627)129081450</subfield><subfield code="w">(DE-600)3459-9</subfield><subfield code="w">(DE-576)014414325</subfield><subfield code="x">0025-5661</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:1991</subfield><subfield code="g">number:1</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:117-146</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF02090394</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 6845</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 6845</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">1991</subfield><subfield code="e">1</subfield><subfield code="c">12</subfield><subfield code="h">117-146</subfield></datafield></record></collection>
score	7.400671

Nicht das Richtige dabei?

Schreiben Sie uns!

A geometrical view of the determinization and minimization of finite-state automata

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?