On the commutative equivalence of bounded context-free and regular languages: The semi-linear case
This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
D'Alessandro, Flavio [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
24 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries - Schweiss, Rüdiger ELSEVIER, 2015transfer abstract, the journal of the EATCS, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:572 ; year:2015 ; day:23 ; month:03 ; pages:1-24 ; extent:24 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.tcs.2015.01.008 |
|---|
| Katalog-ID: |
ELV039747786 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV039747786 | ||
| 003 | DE-627 | ||
| 005 | 20230624063955.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2015 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.tcs.2015.01.008 |2 doi | |
| 028 | 5 | 2 | |a GBVA2015010000021.pica |
| 035 | |a (DE-627)ELV039747786 | ||
| 035 | |a (ELSEVIER)S0304-3975(15)00035-3 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | 4 | |a 004 |q DE-600 |
| 082 | 0 | 4 | |a 620 |q VZ |
| 082 | 0 | 4 | |a 690 |q VZ |
| 084 | |a 50.92 |2 bkl | ||
| 100 | 1 | |a D'Alessandro, Flavio |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On the commutative equivalence of bounded context-free and regular languages: The semi-linear case |
| 264 | 1 | |c 2015 | |
| 300 | |a 24 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. | ||
| 650 | 7 | |a Bounded context-free language |2 Elsevier | |
| 650 | 7 | |a Commutative equivalence |2 Elsevier | |
| 650 | 7 | |a Semilinear set |2 Elsevier | |
| 700 | 1 | |a Intrigila, Benedetto |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Schweiss, Rüdiger ELSEVIER |t Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |d 2015transfer abstract |d the journal of the EATCS |g Amsterdam [u.a.] |w (DE-627)ELV013125583 |
| 773 | 1 | 8 | |g volume:572 |g year:2015 |g day:23 |g month:03 |g pages:1-24 |g extent:24 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.tcs.2015.01.008 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_40 | ||
| 936 | b | k | |a 50.92 |j Meerestechnik |q VZ |
| 951 | |a AR | ||
| 952 | |d 572 |j 2015 |b 23 |c 0323 |h 1-24 |g 24 | ||
| 953 | |2 045F |a 004 | ||
| author_variant |
f d fd |
|---|---|
| matchkey_str |
dalessandroflaviointrigilabenedetto:2015----:nhcmuaieqiaecobuddotxfeadeualn |
| hierarchy_sort_str |
2015 |
| bklnumber |
50.92 |
| publishDate |
2015 |
| allfields |
10.1016/j.tcs.2015.01.008 doi GBVA2015010000021.pica (DE-627)ELV039747786 (ELSEVIER)S0304-3975(15)00035-3 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl D'Alessandro, Flavio verfasserin aut On the commutative equivalence of bounded context-free and regular languages: The semi-linear case 2015 24 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set Elsevier Intrigila, Benedetto oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 https://doi.org/10.1016/j.tcs.2015.01.008 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 572 2015 23 0323 1-24 24 045F 004 |
| spelling |
10.1016/j.tcs.2015.01.008 doi GBVA2015010000021.pica (DE-627)ELV039747786 (ELSEVIER)S0304-3975(15)00035-3 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl D'Alessandro, Flavio verfasserin aut On the commutative equivalence of bounded context-free and regular languages: The semi-linear case 2015 24 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set Elsevier Intrigila, Benedetto oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 https://doi.org/10.1016/j.tcs.2015.01.008 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 572 2015 23 0323 1-24 24 045F 004 |
| allfields_unstemmed |
10.1016/j.tcs.2015.01.008 doi GBVA2015010000021.pica (DE-627)ELV039747786 (ELSEVIER)S0304-3975(15)00035-3 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl D'Alessandro, Flavio verfasserin aut On the commutative equivalence of bounded context-free and regular languages: The semi-linear case 2015 24 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set Elsevier Intrigila, Benedetto oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 https://doi.org/10.1016/j.tcs.2015.01.008 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 572 2015 23 0323 1-24 24 045F 004 |
| allfieldsGer |
10.1016/j.tcs.2015.01.008 doi GBVA2015010000021.pica (DE-627)ELV039747786 (ELSEVIER)S0304-3975(15)00035-3 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl D'Alessandro, Flavio verfasserin aut On the commutative equivalence of bounded context-free and regular languages: The semi-linear case 2015 24 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set Elsevier Intrigila, Benedetto oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 https://doi.org/10.1016/j.tcs.2015.01.008 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 572 2015 23 0323 1-24 24 045F 004 |
| allfieldsSound |
10.1016/j.tcs.2015.01.008 doi GBVA2015010000021.pica (DE-627)ELV039747786 (ELSEVIER)S0304-3975(15)00035-3 DE-627 ger DE-627 rakwb eng 004 004 DE-600 620 VZ 690 VZ 50.92 bkl D'Alessandro, Flavio verfasserin aut On the commutative equivalence of bounded context-free and regular languages: The semi-linear case 2015 24 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set Elsevier Intrigila, Benedetto oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 https://doi.org/10.1016/j.tcs.2015.01.008 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 572 2015 23 0323 1-24 24 045F 004 |
| language |
English |
| source |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 |
| sourceStr |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:572 year:2015 day:23 month:03 pages:1-24 extent:24 |
| format_phy_str_mv |
Article |
| bklname |
Meerestechnik |
| institution |
findex.gbv.de |
| topic_facet |
Bounded context-free language Commutative equivalence Semilinear set |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| authorswithroles_txt_mv |
D'Alessandro, Flavio @@aut@@ Intrigila, Benedetto @@oth@@ |
| publishDateDaySort_date |
2015-01-23T00:00:00Z |
| hierarchy_top_id |
ELV013125583 |
| dewey-sort |
14 |
| id |
ELV039747786 |
| 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">ELV039747786</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230624063955.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2015.01.008</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015010000021.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039747786</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(15)00035-3</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=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">D'Alessandro, Flavio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the commutative equivalence of bounded context-free and regular languages: The semi-linear case</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bounded context-free language</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Commutative equivalence</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semilinear set</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Intrigila, Benedetto</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:572</subfield><subfield code="g">year:2015</subfield><subfield code="g">day:23</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:1-24</subfield><subfield code="g">extent:24</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2015.01.008</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</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_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">572</subfield><subfield code="j">2015</subfield><subfield code="b">23</subfield><subfield code="c">0323</subfield><subfield code="h">1-24</subfield><subfield code="g">24</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| author |
D'Alessandro, Flavio |
| spellingShingle |
D'Alessandro, Flavio ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set On the commutative equivalence of bounded context-free and regular languages: The semi-linear case |
| authorStr |
D'Alessandro, Flavio |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013125583 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations 690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
004 004 DE-600 620 VZ 690 VZ 50.92 bkl On the commutative equivalence of bounded context-free and regular languages: The semi-linear case Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set Elsevier |
| topic |
ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set |
| topic_unstemmed |
ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set |
| topic_browse |
ddc 004 ddc 620 ddc 690 bkl 50.92 Elsevier Bounded context-free language Elsevier Commutative equivalence Elsevier Semilinear set |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
b i bi |
| hierarchy_parent_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| hierarchy_parent_id |
ELV013125583 |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering 690 - Building & construction |
| hierarchy_top_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013125583 |
| title |
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case |
| ctrlnum |
(DE-627)ELV039747786 (ELSEVIER)S0304-3975(15)00035-3 |
| title_full |
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case |
| author_sort |
D'Alessandro, Flavio |
| journal |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| journalStr |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
zzz |
| container_start_page |
1 |
| author_browse |
D'Alessandro, Flavio |
| container_volume |
572 |
| physical |
24 |
| class |
004 004 DE-600 620 VZ 690 VZ 50.92 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
D'Alessandro, Flavio |
| doi_str_mv |
10.1016/j.tcs.2015.01.008 |
| dewey-full |
004 620 690 |
| title_sort |
on the commutative equivalence of bounded context-free and regular languages: the semi-linear case |
| title_auth |
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case |
| abstract |
This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. |
| abstractGer |
This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. |
| abstract_unstemmed |
This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 |
| title_short |
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case |
| url |
https://doi.org/10.1016/j.tcs.2015.01.008 |
| remote_bool |
true |
| author2 |
Intrigila, Benedetto |
| author2Str |
Intrigila, Benedetto |
| ppnlink |
ELV013125583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.tcs.2015.01.008 |
| up_date |
2024-07-06T21:24:13.206Z |
| _version_ |
1803866397168631808 |
| 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">ELV039747786</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230624063955.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2015.01.008</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2015010000021.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV039747786</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(15)00035-3</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=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">D'Alessandro, Flavio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the commutative equivalence of bounded context-free and regular languages: The semi-linear case</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This is the third paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ : A ⁎ ⟶ N t be the corresponding Parikh morphism. Given two languages L 1 , L 2 ⊆ A ⁎ , we say that L 1 is commutatively equivalent to L 2 if there exists a bijection f : L 1 ⟶ L 2 from L 1 onto L 2 such that, for every u ∈ L 1 , ψ ( u ) = ψ ( f ( u ) ) . Then every bounded context-free language is commutatively equivalent to a regular language.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bounded context-free language</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Commutative equivalence</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semilinear set</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Intrigila, Benedetto</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:572</subfield><subfield code="g">year:2015</subfield><subfield code="g">day:23</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:1-24</subfield><subfield code="g">extent:24</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2015.01.008</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</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_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">572</subfield><subfield code="j">2015</subfield><subfield code="b">23</subfield><subfield code="c">0323</subfield><subfield code="h">1-24</subfield><subfield code="g">24</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">004</subfield></datafield></record></collection>
|
| score |
7.4013214 |