- 5 Ergebnisse
Kleinster Preis: € 7,20, größter Preis: € 117,43, Mittelwert: € 89,97
1
Language and Automata Theory and Applications Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Bestellen
bei buchfreund.de
€ 117,43
Versand: € 0,001
Bestellengesponserter Link

Language and Automata Theory and Applications Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings - neues Buch

2009, ISBN: 9783642009815

Kartoniert, 772 Seiten, 235mm x 155mm x 42mm, Sprache(n): eng This book constitutes the refereed proceedings of the Third International Conference on Language and Automata Theory and Appl… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES Buch- und Medienhandel, 14621 Schönwalde-Glien
2
Language and Automata Theory and Applications Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings - Dediu, Adrian Horia (Herausgeber); Martin-Vide, Carlos (Herausgeber); Ionescu, Armand Mihai (Herausgeber)
Bestellen
bei Achtung-Buecher.de
€ 111,22
Versand: € 0,001
Bestellengesponserter Link

Dediu, Adrian Horia (Herausgeber); Martin-Vide, Carlos (Herausgeber); Ionescu, Armand Mihai (Herausgeber):

Language and Automata Theory and Applications Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings - neues Buch

2009, ISBN: 3642009816

2009 Kartoniert / Broschiert Mathematik / Informatik, Computer, Theoretische Informatik, Automat; Chomskygrammar; LA; automatatheory; cellularautomata; combinatoricsonwords; communicati… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
3
Bestellen
bei AbeBooks.de
£ 6,14
(ca. € 7,20)
Versand: € 7,601
Bestellengesponserter Link
Dediu, Adrian Horia, Armand Mihai Ionescu und Carlos Martin-Vide:
Language and Automata Theory and Applications Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings - Taschenbuch

2009

ISBN: 3642009816

[EAN: 9783642009815], Gebraucht, guter Zustand, [PU: Springer Berlin], AUTOMATA THEORY,AUTOMATA,COMPLEXITY SPACE,COMMUNICATION COMPLEXITY,COMBINATORICS ON WORDS,CELLULAR AUTOMATA,DENOTATI… Mehr…

NOT NEW BOOK. Versandkosten: EUR 7.60 Buchpark, Trebbin, Germany [83435977] [Rating: 5 (von 5)]
4
Language and Automata Theory and Applications
Bestellen
bei Hugendubel.de
€ 106,99
Versand: € 0,001
Bestellengesponserter Link
Language and Automata Theory and Applications - Taschenbuch

2009, ISBN: 9783642009815

*Language and Automata Theory and Applications* - Third International Conference LATA 2009 Tarragona Spain April 2-8 2009. Proceedings. Auflage 2009 / Taschenbuch für 106.99 € / Aus dem B… Mehr…

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)
5
Language and Automata Theory and Applications
Bestellen
bei Hugendubel.de
€ 106,99
Versand: € 0,001
Bestellengesponserter Link
Language and Automata Theory and Applications - Taschenbuch

2009, ISBN: 9783642009815

*Language and Automata Theory and Applications* - Third International Conference LATA 2009 Tarragona Spain April 2-8 2009. Proceedings. Auflage 2009 / Taschenbuch für 106.99 € / Aus dem B… Mehr…

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Language and Automata Theory and Applications

This book constitutes the refereed proceedings of the Third International Conference on Language and Automata Theory and Applications, LATA 2009, held in Tarragona, Spain, in April 2009. The 58 revised full papers presented together with 3 invited lectures and two tutorials were carefully reviewed and selected from 121 submissions. The papers address all the various issues related to automata theory and formal languages.

Detailangaben zum Buch - Language and Automata Theory and Applications


EAN (ISBN-13): 9783642009815
ISBN (ISBN-10): 3642009816
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2009
Herausgeber: Springer Berlin Heidelberg
751 Seiten
Gewicht: 1,142 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-25T03:14:09+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-02-13T15:43:08+01:00 (Berlin)
ISBN/EAN: 9783642009815

ISBN - alternative Schreibweisen:
3-642-00981-6, 978-3-642-00981-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: ionescu, armand, carlos, hori, arman, ion, adrian self, carl martin, horia
Titel des Buches: tarragona, automaton theory, conférence, third international theory, the automat, april, lecture notes computer science automata, language, theory and applications


Daten vom Verlag:

Autor/in: Adrian Horia Dediu; Armand Mihai Ionescu; Carlos Martin-Vide
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Language and Automata Theory and Applications - Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Verlag: Springer; Springer Berlin
754 Seiten
Erscheinungsjahr: 2009-03-09
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 1,163 kg
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XV, 754 p.

BC; Mathematical Logic and Formal Languages; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; Automat; Chomsky grammar; LA; automata; automata theory; cellular automata; combinatorics on words; communication complexity; complexity space; computability; computational biology; context-free grammar; denotational semanti; formal language; formal languages; Theory of Computation; Symbolic and Algebraic Manipulation; Logics and Meanings of Programs; Mathematics of Computing; Computation by Abstract Devices; Formal Languages and Automata Theory; Theory of Computation; Symbolic and Algebraic Manipulation; Computer Science Logic and Foundations of Programming; Mathematics of Computing; Mathematik für Informatiker; EA

Invited Talks.- Recent Developments in Algorithmic Teaching.- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications.- Descriptional and Computational Complexity of Finite Automata.- Hypothesis Spaces for Learning.- State Complexity of Nested Word Automata.- Regular Papers.- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations.- Minimal Union-Free Decompositions of Regular Languages.- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory.- Matching Trace Patterns with Regular Policies.- Absolute Convergence of Rational Series Is Semi-decidable.- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG].- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights.- Refinement and Consistency of Timed Modal Specifications.- Nondeterministic Instance Complexity and Proof Systems with Advice.- How Many Holes Can an Unbordered Partial Word Contain?.- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization.- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication.- Picture Languages Generated by Assembling Tiles.- Undecidability of Operation Problems for T0L Languages and Subclasses.- Decision Problems for Convex Languages.- On a Family of Morphic Images of Arnoux-Rauzy Words.- Monadic Datalog Tree Transducers.- On Extended Regular Expressions.- Multi-tilde Operators and Their Glushkov Automata.- Non-uniform Cellular Automata.- A Cryptosystem Based on the Composition of Reversible Cellular Automata.- Grammars Controlled by Special Petri Nets.- Nested Counters in Bit-Parallel String Matching.- Bounded Delay and Concurrency for Earliest Query Answering.- Learning by Erasing in Dynamic Epistemic Logic.- The Fault Tolerance of NP-Hard Problems.- Termination of Priority Rewriting.- State Complexity of Combined Operations for Prefix-Free Regular Languages.- Towards a Taxonomy for ECFG and RRPG Parsing.- Counting Parameterized Border Arrays for a Binary Alphabet.- Bounded Hairpin Completion.- Rigid Tree Automata.- Converting Self-verifying Automata into Deterministic Automata.- Two Equivalent Regularizations for Tree Adjoining Grammars.- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching.- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.- Automata on Gauss Words.- Analysing Complexity in Classes of Unary Automatic Structures.- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words.- Segmentation Charts for Czech – Relations among Segments in Complex Sentences.- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions.- Efficiency of the Symmetry Bias in Grammar Acquisition.- A Series of Run-Rich Strings.- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes.- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates.- Prediction of Creole Emergence in Spatial Language Dynamics.- On the Average Size of Glushkov’s Automata.- Tiling the Plane with a Fixed Number of Polyominoes.- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality.- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.- Finitely Generated Synchronizing Automata.- Genetic Algorithm for Synchronization.- Constructing Infinite Words of Intermediate Arithmetical Complexity.- From Gene Trees to Species Trees through a Supertree Approach.- A Kleene Theorem for Forest Languages.- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions.- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit.

< zum Archiv...