Language and automata theory and applications: 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2013
|
| Schriftenreihe: | Lecture notes in computer science
7810 |
| Schlagworte: | |
| Online-Zugang: | Volltext Inhaltsverzeichnis Abstract |
| Beschreibung: | Literaturangaben |
| Beschreibung: | 1 Online-Ressource (XIV, 580 S.) graph. Darst. |
| ISBN: | 9783642370632 9783642370649 |
| DOI: | 10.1007/978-3-642-37064-9 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV041388385 | ||
| 003 | DE-604 | ||
| 005 | 20140227 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 131029s2013 xx d||| o|||| 10||| eng d | ||
| 020 | |a 9783642370632 |c kart. : ca. EUR 74.90 (DE) (freier Pr.), ca. EUR 77.00 (AT) (freier Pr.), ca. sfr 93.50 (freier Pr.) |9 978-3-642-37063-2 | ||
| 020 | |a 9783642370649 |c Online |9 978-3-642-37064-9 | ||
| 024 | 7 | |a 10.1007/978-3-642-37064-9 |2 doi | |
| 035 | |a (OCoLC)840568950 | ||
| 035 | |a (DE-599)BVBBV041388385 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-M347 |a DE-20 |a DE-703 |a DE-Aug4 |a DE-92 |a DE-29 |a DE-859 |a DE-739 |a DE-91 |a DE-706 |a DE-384 |a DE-634 |a DE-355 | ||
| 082 | 0 | |a 004 | |
| 082 | 0 | |a 005.131 |2 22/ger | |
| 084 | |a DAT 555f |2 stub | ||
| 084 | |a DAT 550f |2 stub | ||
| 084 | |a DAT 000 |2 stub | ||
| 245 | 1 | 0 | |a Language and automata theory and applications |b 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings |c Adrian-Horia Dediu ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2013 | |
| 300 | |a 1 Online-Ressource (XIV, 580 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 7810 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2013 |z Bilbao |2 gnd-content | |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Dediu, Adrian-Horia |d 1961- |e Sonstige |0 (DE-588)1035442701 |4 oth | |
| 711 | 2 | |a LATA |n 7 |d 2013 |c Bilbao |j Sonstige |0 (DE-588)103449385X |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 7810 |w (DE-604)BV014880109 |9 7810 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-37064-9 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-026836229 | |
Datensatz im Suchindex
| _version_ | 1820875482928775168 |
|---|---|
| adam_text |
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
/
: 2013
TABLE OF CONTENTS / INHALTSVERZEICHNIS
COMPLEXITY DICHOTOMY FOR COUNTING PROBLEMS.-ALGORITHMS FOR ANALYZING
AND VERIFYING INFINITE-STATE RECURSIVE PROBABILISTIC
SYSTEMS.-RECURSION SCHEMES, COLLAPSIBLE PUSHDOWN AUTOMATA AND
HIGHER-ORDER MODEL CHECKING.-DISCRETE LINEAR DYNAMICAL SYSTEMS.-XML
SCHEMA MANAGEMENT: A CHALLENGE FOR AUTOMATA THEORY
ON THE COMPLEXITY OF SHORTEST PATH PROBLEMS ON DISCOUNTED COST
GRAPHS.-TERMINATION OF RULE-BASED CALCULI FOR UNIFORM
SEMI-UNIFICATION.-DECIDING WQO FOR FACTORIAL LANGUAGES.-ON THE
CONSTRUCTION OF A FAMILY OF AUTOMATA THAT ARE GENERICALLY
NON-MINIMAL.-LIMITED NON-DETERMINISM HIERARCHY OF COUNTER
AUTOMATA.-UNAMBIGUOUS AUTOMATA DENOTING FINITELY SEQUENTIAL
FUNCTIONS.-DUPLICATION-LOSS GENOME ALIGNMENT: COMPLEXITY AND
ALGORITHM.-MAXIMIZING ENTROPY OVER MARKOV PROCESSES.-MAT LEARNING OF
UNIVERSAL AUTOMATA.-A GRAPH POLYNOMIAL APPROACH TO
PRIMITIVITY.-SUFFIX TREES FOR PARTIAL WORDS AND THE LONGEST COMMON
COMPATIBLE PREFIX PROBLEM.-DYNAMIC COMMUNICATING AUTOMATA AND
BRANCHING HIGH-LEVEL MSCS.-VISIBLY PUSHDOWN AUTOMATA: UNIVERSALITY AND
INCLUSION VIA ANTICHAINS
TWO-SIDED DERIVATIVES FOR REGULAR EXPRESSIONS AND FOR HAIRPIN
EXPRESSIONS.-HOW TO TRAVEL BETWEEN LANGUAGES.-EXECUTION INFORMATION
RATE FOR SOME CLASSES OF AUTOMATA.-DECIDABILITY AND COMPLEXITY RESULTS
FOR VERIFICATION OF ASYNCHRONOUS BROADCAST NETWORKS.-THE BUFFERED
Π-CALCULUS: A MODEL FOR CONCURRENT LANGUAGES.-MIX-AUTOMATIC
SEQUENCES.-A MULTIVARIATE ANALYSIS OF SOME DFA PROBLEMS
ON THE SIZE COMPLEXITY OF DETERMINISTIC FREQUENCY AUTOMATA
ON THE NUMBER OF UNBORDERED FACTORS
PRIMITIVE WORDS AND LYNDON WORDS IN AUTOMATIC AND LINEARLY RECURRENT
SEQUENCES.-EFFICIENT SUBMATCH EXTRACTION FOR PRACTICAL REGULAR
EXPRESSIONS.-DETERMINACY AND SUBSUMPTION FOR SINGLE-VALUED BOTTOM-UP
TREE TRANSDUCERS
REVEALING VS. CONCEALING: MORE SIMULATION GAMES FOR BUECHI
INCLUSION.-ON BOUNDED LANGUAGES AND REVERSAL-BOUNDED
AUTOMATA.-REWRITE CLOSURE AND CF HEDGE AUTOMATA.-LINEAR-TIME VERSION
OF HOLUB’S ALGORITHM FOR MORPHIC IMPRIMITIVITY TESTING.-FROM REGULAR
TREE EXPRESSION TO POSITION TREE AUTOMATON
CONVERGENCE OF NEWTON’S METHOD OVER COMMUTATIVE SEMIRINGS
COUNTING MINIMAL SYMMETRIC DIFFERENCE NFAS
INTERVAL LOGICS AND ΩB-REGULAR LANGUAGES.-ELIMINATING STACK SYMBOLS
IN PUSH-DOWN AUTOMATA AND LINEAR INDEXED GRAMMARS.-ASYNCHRONOUS PC
SYSTEMS OF PUSHDOWN AUTOMATA
MODEL CHECKING METRIC TEMPORAL LOGIC OVER AUTOMATA WITH ONE
COUNTER.-COINDUCTIVE PROOF TECHNIQUES FOR LANGUAGE
EQUIVALENCE.-OSTROWSKI NUMERATION AND THE LOCAL PERIOD OF STURMIAN
WORDS.-BOOLEAN ALGEBRAS OF REGULAR Ω-LANGUAGES.-PUMPING, SHRINKING
AND PRONOUNS: FROM CONTEXT FREE TO INDEXED GRAMMARS.-ONLINE MATCHING
OF MULTIPLE REGULAR PATTERNS WITH GAPS AND CHARACTER
CLASSES.-INFINITENESS AND BOUNDEDNESS IN 0L, DT0L, AND T0L
SYSTEMS.-UNIFORMISATION OF TWO-WAY TRANSDUCERS.-A CONDITIONAL
SUPERPOLYNOMIAL LOWER BOUND FOR EXTENDED RESOLUTION
A TURING MACHINE DISTANCE HIERARCHY. ALGORITHMS FOR ANALYZING AND
VERIFYING INFINITE-STATE RECURSIVE PROBABILISTIC SYSTEMS.-RECURSION
SCHEMES, COLLAPSIBLE PUSHDOWN AUTOMATA AND HIGHER-ORDER MODEL
CHECKING.-DISCRETE LINEAR DYNAMICAL SYSTEMS.-XML SCHEMA MANAGEMENT:
A CHALLENGE FOR AUTOMATA THEORY
ON THE COMPLEXITY OF SHORTEST PATH PROBLEMS ON DISCOUNTED COST
GRAPHS.-TERMINATION OF RULE-BASED CALCULI FOR UNIFORM
SEMI-UNIFICATION.-DECIDING WQO FOR FACTORIAL LANGUAGES.-ON THE
CONSTRUCTION OF A FAMILY OF AUTOMATA THAT ARE GENERICALLY
NON-MINIMAL.-LIMITED NON-DETERMINISM HIERARCHY OF COUNTER
AUTOMATA.-UNAMBIGUOUS AUTOMATA DENOTING FINITELY SEQUENTIAL
FUNCTIONS.-DUPLICATION-LOSS GENOME ALIGNMENT: COMPLEXITY AND
ALGORITHM.-MAXIMIZING ENTROPY OVER MARKOV PROCESSES.-MAT LEARNING OF
UNIVERSAL AUTOMATA.-A GRAPH POLYNOMIAL APPROACH TO
PRIMITIVITY.-SUFFIX TREES FOR PARTIAL WORDS AND THE LONGEST COMMON
COMPATIBLE PREFIX PROBLEM.-DYNAMIC COMMUNICATING AUTOMATA AND
BRANCHING HIGH-LEVEL MSCS.-VISIBLY PUSHDOWN AUTOMATA: UNIVERSALITY AND
INCLUSION VIA ANTICHAINS
TWO-SIDED DERIVATIVES FOR REGULAR EXPRESSIONS AND FOR HAIRPIN
EXPRESSIONS.-HOW TO TRAVEL BETWEEN LANGUAGES.-EXECUTION INFORMATION
RATE FOR SOME CLASSES OF AUTOMATA.-DECIDABILITY AND COMPLEXITY RESULTS
FOR VERIFICATION OF ASYNCHRONOUS BROADCAST NETWORKS.-THE BUFFERED
Π-CALCULUS: A MODEL FOR CONCURRENT LANGUAGES.-MIX-AUTOMATIC
SEQUENCES.-A MULTIVARIATE ANALYSIS OF SOME DFA PROBLEMS
ON THE SIZE COMPLEXITY OF DETERMINISTIC FREQUENCY AUTOMATA
ON THE NUMBER OF UNBORDERED FACTORS
PRIMITIVE WORDS AND LYNDON WORDS IN AUTOMATIC AND LINEARLY RECURRENT
SEQUENCES.-EFFICIENT SUBMATCH EXTRACTION FOR PRACTICAL REGULAR
EXPRESSIONS.-DETERMINACY AND SUBSUMPTION FOR SINGLE-VALUED BOTTOM-UP
TREE TRANSDUCERS
REVEALING VS. CONCEALING: MORE SIMULATION GAMES FOR BUECHI
INCLUSION.-ON BOUNDED LANGUAGES AND REVERSAL-BOUNDED
AUTOMATA.-REWRITE CLOSURE AND CF HEDGE AUTOMATA.-LINEAR-TIME VERSION
OF HOLUB’S ALGORITHM FOR MORPHIC IMPRIMITIVITY TESTING.-FROM REGULAR
TREE EXPRESSION TO POSITION TREE AUTOMATON
CONVERGENCE OF NEWTON’S METHOD OVER COMMUTATIVE SEMIRINGS
COUNTING MINIMAL SYMMETRIC DIFFERENCE NFAS
INTERVAL LOGICS AND ΩB-REGULAR LANGUAGES.-ELIMINATING STACK SYMBOLS
IN PUSH-DOWN AUTOMATA AND LINEAR INDEXED GRAMMARS.-ASYNCHRONOUS PC
SYSTEMS OF PUSHDOWN AUTOMATA
MODEL CHECKING METRIC TEMPORAL LOGIC OVER AUTOMATA WITH ONE
COUNTER.-COINDUCTIVE PROOF TECHNIQUES FOR LANGUAGE
EQUIVALENCE.-OSTROWSKI NUMERATION AND THE LOCAL PERIOD OF STURMIAN
WORDS.-BOOLEAN ALGEBRAS OF REGULAR Ω-LANGUAGES.-PUMPING, SHRINKING
AND PRONOUNS: FROM CONTEXT FREE TO INDEXED GRAMMARS.-ONLINE MATCHING
OF MULTIPLE REGULAR PATTERNS WITH GAPS AND CHARACTER
CLASSES.-INFINITENESS AND BOUNDEDNESS IN 0L, DT0L, AND T0L
SYSTEMS.-UNIFORMISATION OF TWO-WAY TRANSDUCERS.-A CONDITIONAL
SUPERPOLYNOMIAL LOWER BOUND FOR EXTENDED RESOLUTION
A TURING MACHINE DISTANCE HIERARCHY
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
/
: 2013
ABSTRACT / INHALTSTEXT
THIS BOOK CONSTITUTES THE REFEREED PROCEEDINGS OF THE 7TH INTERNATIONAL
CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2013,
HELD IN BILBAO, SPAIN IN APRIL 2013. THE 45 REVISED FULL PAPERS
PRESENTED TOGETHER WITH 5 INVITED TALKS WERE CAREFULLY REVIEWED AND
SELECTED FROM 97 INITIAL SUBMISSIONS. THE VOLUME FEATURES CONTRIBUTIONS
FROM BOTH CLASSICAL THEORY FIELDS AND APPLICATION AREAS (BIOINFORMATICS,
SYSTEMS BIOLOGY, LANGUAGE TECHNOLOGY, ARTIFICIAL INTELLIGENCE, ETC.).
AMONG THE TOPICS COVERED ARE ALGEBRAIC LANGUAGE THEORY; ALGORITHMS FOR
SEMI-STRUCTURED DATA MINING; ALGORITHMS ON AUTOMATA AND WORDS; AUTOMATA
AND LOGIC; AUTOMATA FOR SYSTEM ANALYSIS AND PROGRAM VERIFIATION;
AUTOMATA, CONCURRENCY AND PETRI NETS; AUTOMATIC STRUCTURES; CELLULAR
AUTOMATA; COMBINATORICS ON WORDS; COMPUTABILITY; COMPUTATIONAL
COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA AND IMAGE COMPRESSION;
DECIDABILITY QUESTIONS ON WORDS AND LANGUAGES; DESCRIPTIONAL COMPLEXITY;
DNA AND OTHER MODELS OF BIO-INSPIRED COMPUTING; DOCUMENT ENGINEERING;
FOUNDATIONS OF FINITE STATE TECHNOLOGY; FOUNDATIONS OF XML; FUZZY AND
ROUGH LANGUAGES; GRAMMARS (CHOMSKY HIERARCHY, CONTEXTUAL,
MULTIDIMENSIONAL, UNIFICATION, CATEGORIAL, ETC.); GRAMMARS AND AUTOMATA
ARCHITECTURES; GRAMMATICAL INFERENCE AND ALGORITHMIC LEARNING; GRAPHS
AND GRAPH TRANSFORMATION; LANGUAGE VARIETIES AND SEMIGROUPS;
LANGUAGE-BASED CRYPTOGRAPHY; LANGUAGE-THEORETIC FOUNDATIONS OF
ARTIFICIAL INTELLIGENCE AND ARTIFI- CIAL LIFE; PARALLEL AND REGULATED
REWRITING; PARSING; PATTERN RECOGNITION; PATTERNS AND CODES; POWER
SERIES; QUANTUM, CHEMICAL AND OPTICAL COMPUTING; SEMANTICS; STRING AND
COMBINATORIAL ISSUES IN COMPUTATIONAL BIOLOGY AND BIOINFORMATICS; STRING
PROCESSING ALGORITHMS; SYMBOLIC DYNAMICS; SYMBOLIC NEURAL NETWORKS; TERM
REWRITING; TRANSDUCERS; TREES, TREE LANGUAGES AND TREE AUTOMATA;
WEIGHTED AUTOMATA
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT. |
| any_adam_object | 1 |
| author_GND | (DE-588)1035442701 |
| building | Verbundindex |
| bvnumber | BV041388385 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 555f DAT 550f DAT 000 |
| collection | ZDB-2-SCS ZDB-2-LNC |
| ctrlnum | (OCoLC)840568950 (DE-599)BVBBV041388385 |
| dewey-full | 004 005.131 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science 005 - Computer programming, programs, data, security |
| dewey-raw | 004 005.131 |
| dewey-search | 004 005.131 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-37064-9 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV041388385</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140227</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">131029s2013 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642370632</subfield><subfield code="c">kart. : ca. EUR 74.90 (DE) (freier Pr.), ca. EUR 77.00 (AT) (freier Pr.), ca. sfr 93.50 (freier Pr.)</subfield><subfield code="9">978-3-642-37063-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642370649</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-37064-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-37064-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)840568950</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041388385</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 555f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 550f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Language and automata theory and applications</subfield><subfield code="b">7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings</subfield><subfield code="c">Adrian-Horia Dediu ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 580 S.)</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7810</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2013</subfield><subfield code="z">Bilbao</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dediu, Adrian-Horia</subfield><subfield code="d">1961-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1035442701</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">LATA</subfield><subfield code="n">7</subfield><subfield code="d">2013</subfield><subfield code="c">Bilbao</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)103449385X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7810</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">7810</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-37064-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026836229</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2013 Bilbao gnd-content |
| genre_facet | Konferenzschrift 2013 Bilbao |
| id | DE-604.BV041388385 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:16:19Z |
| institution | BVB |
| institution_GND | (DE-588)103449385X |
| isbn | 9783642370632 9783642370649 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-026836229 |
| oclc_num | 840568950 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-Aug4 DE-92 DE-29 DE-859 DE-739 DE-91 DE-BY-TUM DE-706 DE-384 DE-634 DE-355 DE-BY-UBR |
| owner_facet | DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-Aug4 DE-92 DE-29 DE-859 DE-739 DE-91 DE-BY-TUM DE-706 DE-384 DE-634 DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XIV, 580 S.) graph. Darst. |
| psigel | ZDB-2-SCS ZDB-2-LNC |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings Adrian-Horia Dediu ... (eds.) Berlin [u.a.] Springer 2013 1 Online-Ressource (XIV, 580 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 7810 Literaturangaben Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2013 Bilbao gnd-content Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s DE-604 Dediu, Adrian-Horia 1961- Sonstige (DE-588)1035442701 oth LATA 7 2013 Bilbao Sonstige (DE-588)103449385X oth Lecture notes in computer science 7810 (DE-604)BV014880109 7810 https://doi.org/10.1007/978-3-642-37064-9 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract |
| spellingShingle | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings Lecture notes in computer science Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4017848-1 (DE-588)1071861417 |
| title | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings |
| title_auth | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings |
| title_exact_search | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings |
| title_full | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings Adrian-Horia Dediu ... (eds.) |
| title_fullStr | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings Adrian-Horia Dediu ... (eds.) |
| title_full_unstemmed | Language and automata theory and applications 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings Adrian-Horia Dediu ... (eds.) |
| title_short | Language and automata theory and applications |
| title_sort | language and automata theory and applications 7th international conference lata 2013 bilbao spain april 2 5 2013 proceedings |
| title_sub | 7th international conference, LATA 2013, Bilbao, Spain, April 2 - 5, 2013 ; proceedings |
| topic | Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Automatentheorie Formale Sprache Konferenzschrift 2013 Bilbao |
| url | https://doi.org/10.1007/978-3-642-37064-9 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=026836229&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT dediuadrianhoria languageandautomatatheoryandapplications7thinternationalconferencelata2013bilbaospainapril252013proceedings AT latabilbao languageandautomatatheoryandapplications7thinternationalconferencelata2013bilbaospainapril252013proceedings |