Language and Automata Theory and Applications
Springer International Publishing (Verlag)
978-3-319-53732-0 (ISBN)
This book constitutes the refereed proceedings of the 11th International Conference on Language and Automata Theory and Applications, LATA 2017, held in Umeå, Sweden, in March 2017.
The 31 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 73 submissions. The papers cover the following topics: algorithmic learning and semantics; automata and logics; combinatorics on words, compression, and pattern matching; complexity; finite automata; grammars, languages, and parsing; graphs and Petri Nets; non-classical automata; and pushdown automata and systems.
Algorithmic learning and semantics.- Automata and logics.- Combinatorics on words, compression, and pattern matching.- Complexity.- Finite automata.- Grammars, languages, and parsing.- Graphs and Petri Nets.- Non-classical automata.- Pushdown automata and systems.
Erscheinungsdatum | 07.03.2017 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XXIII, 462 p. 59 illus. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Informatik ► Software Entwicklung ► User Interfaces (HCI) |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Schlagworte | Algorithmic Learning • Applications • Automata • Cellular Automata • Computational Complexity • computation by abstract devices • Computer Science • Computer Science Logic • Concurrency • conference proceedings • context-free languages • Cyber-Physical System • Finite Automata • formal languages and automata theory • Grammars • indexed languages • Informatics • Informatik • Languages • parametrized complexity • Petri Nets • Regular Expressions • Research • Semantics • Theory of Computation • transducers • User interface design and usability • Weighted Automata |
ISBN-10 | 3-319-53732-6 / 3319537326 |
ISBN-13 | 978-3-319-53732-0 / 9783319537320 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich