The 45 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 116 submissions. The papers cover the following topics: algebraic language theory; algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata, concurrency and Petri nets; automatic structures; combinatorics on words; computability; computational complexity; descriptional complexity; DNA and other models of bio-inspired computing; foundations of finite state technology; foundations of XML; grammars (Chomsky hierarchy, contextual, unification, categorial, etc.); grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parsing; patterns; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014, Proceedings
The 45 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 116 submissions. The papers cover the following topics: algebraic language theory; algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata, concurrency and Petri nets; automatic structures; combinatorics on words; computability; computational complexity; descriptional complexity; DNA and other models of bio-inspired computing; foundations of finite state technology; foundations of XML; grammars (Chomsky hierarchy, contextual, unification, categorial, etc.); grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parsing; patterns; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
- ISBN:
- 9783319049205
- 9783319049205
- Category:
- Mathematical theory of computation
- Format:
- Paperback
- Publication Date:
- 03-03-2014
- Language:
- English
- Publisher:
- Springer International Publishing AG
- Country of origin:
- Switzerland
- Pages:
- 614
- Dimensions (mm):
- 235x155x32mm
- Weight:
- 9.36kg
This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 2 - 3 weeks of you placing an order.
Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.
Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:
ACT Metro 2 working days
NSW Metro 2 working days
NSW Rural 2 - 3 working days
NSW Remote 2 - 5 working days
NT Metro 3 - 6 working days
NT Remote 4 - 10 working days
QLD Metro 2 - 4 working days
QLD Rural 2 - 5 working days
QLD Remote 2 - 7 working days
SA Metro 2 - 5 working days
SA Rural 3 - 6 working days
SA Remote 3 - 7 working days
TAS Metro 3 - 6 working days
TAS Rural 3 - 6 working days
VIC Metro 2 - 3 working days
VIC Rural 2 - 4 working days
VIC Remote 2 - 5 working days
WA Metro 3 - 6 working days
WA Rural 4 - 8 working days
WA Remote 4 - 12 working days
Click on Save to My Library / Lists
Click on My Library / My Lists and I will take you there
Share This Book: