| Description |
1 online resource (xiv, 552 pages) |
| Series |
Lecture notes in computer science, 0302-9743 ; 7183 |
|
LNCS sublibrary, SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7183.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Measuring Information in Timed Languages -- Automata-Based Symbolic Representations of Polyhedra / Eugene Asarin -- Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory / Jean-François Degbomont / Julien Brusten / Bernard Boigelot -- Parameterized Complexity Tutorial / Gilles Dowek -- Computer Science of DNA Nanotechnology / Rod Downey -- Minimal Cost Reachability Problem in Priced Timed Pushdown Systems / Jack H. Lutz -- Unification Modulo Chaining / Jan Stenman / Mohamed Faouzi Atig / Parosh Aziz Abdulla -- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits / Christopher Bouchard / Paliath Narendran / Michael Rusinowitch / Siva Anantharam -- Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space / Vikraman Arvind / Yadu Vasudev -- Defining Contexts in Context-Free Grammars / Holger Bock Axelsen -- Longest Common Extensions via Fingerprinting / Alexander Okhotin / Mikhail Barash -- Fast and Cache-Oblivious Dynamic Programming with Local Dependencies / Inge Li Gørtz / Jesper Kristensen / Philip Bille -- Efficient Implicit OBDD-Based Algorithm for Maximal Matchings / Philip Bille / Morten Stöckel -- Strong Termination for Gap-Order Constraint Abstractions of Counter Systems / Tobias Pröger / Beate Bollig -- Covering Space in the Besicovitch Topology / Laura Bozzelli -- Approximate Regular Expressions and Their Derivatives / Julien Cervelle -- Catalytic Petri Nets Are Turing Complete / Ludovic Mignot / Jean-Marc Champarnaud / Hadrien Jeanne -- Computational Complexity of Rule Distributions of Non-uniform Cellular Automata / Gabriel Ciobanu / G. Michele Pinna -- Conservative Groupoids Recognize Only Regular Languages / Julien Provillard / Enrico Formenti / Alberto Dennunzio |
|
Note continued: Advice Complexity of Online Coloring for Paths / Danny Dubé / Mario Latendresse / Pascal Tesson -- Faster Grammar-Based Self-index / Monika Steinová / Lucia Keller / Michal Fori[š]ek -- Learnability of Co-r.e. Classes / Travis Gagie / Julia Kärkkäinen / Simon J. Puglisi / Yakov Nekrich / Pawel Gawrychowski -- Two-Way Automata Making Choices Only at the Endmarkers / Ziyuan Gao / Frank Stephan -- Polynomial-Time Algorithms for Learning Typed Pattern Languages / Viliam Geffert / Bruno Guillon / Giovanni Pighizzini -- Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems / Michael Geilke / Sandra Zilles -- Applying Tree Languages in Proof Theory / Daniela Genova -- Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints / Stefan Hetzl -- Characterizing the Rational Functions by Restarting Transducers / Dag Hovland -- ̂ Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines / Friedrich Otto / Norbert Hundeshagen -- Feasible Automata for Two-Variable Logic with Successor on Data Words / Oscar H. Ibarra / Nicholas Q. Tran -- Nash Equilibria in Concurrent Priced Gaines / Tony Tan / Ahmet Kara / Thomas Schwentick -- Computing by Observing Insertion / Jeppe Thaarup / Miroslav Klimo[š] / Filip [Š]tefanák / Kim G. Larsen -- On the Parameterized Complexity of Default Logic and Autoepistemic Logic / Alexander Krassovitskiy / Peter Leupold -- Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic / Johannes Schmidt / Heribert Vollmer / Michael Thomas / Arne Meier -- On Model Checking for Visibly Pushdown Automata / Alexei Miasnikov / Zoran [Š]unic -- Automaton-Based Array Initialization Analysis / Tang Van Nguyen / Hitoshi Ohsaki -- ̂ Dynamics of Circuits and Intersecting Circuits / Durica Nikolic / Fausto Spoto |
|
Note continued: Canonizable Partial Order Generators / Mathilde Noual -- Ogden's Lemma for ETOL Languages / Mateus de Oliveira Oliveira -- Patterns with Bounded Treewidth / Max Rabkin -- P-NP Threshold for Synchronizing Road Coloring / Daniel Reidenbach / Markus L. Schmid -- k-Automatic Sets of Rational Numbers / Adam Roman -- On Stable and Unstable Limit Sets of Finite Families of Cellular Automata / Eric Rowland / Jeffrey Shallit -- Automaton Ranks of Some Self-similar Groups / Ville Salo / Ilkka Törmä -- One-Way Reversible and Quantum Finite Automata with Advice / Adam Woryna -- Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars / Tomoyuki Yamakami |
| Summary |
This book constitutes the refereed proceedings of the 6th International Conference on Language and Automata Theory and Applications, LATA 2012, held in A Coruña, Spain in March 2012. The 41 revised full papers presented together with 3 invited talks and 2 invited tutorials were carefully reviewed and selected from 114 initial submissions. The volume features contributions from both classical theory fields and application areas; e.g. innformatics, systems biology, language technology, artificial intelligence, etc. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition |
| Analysis |
Computer science |
|
Computer software |
|
Logic design |
|
Artificial intelligence |
|
Computation by Abstract Devices |
|
Mathematical Logic and Formal Languages |
|
Algorithm Analysis and Problem Complexity |
|
Artificial Intelligence (incl. Robotics) |
|
Logics and Meanings of Programs |
|
Computer Appl. in Social and Behavioral Sciences |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
computertechnieken |
|
computer techniques |
|
sociale wetenschappen |
|
social sciences |
|
wiskunde |
|
mathematics |
|
logica |
|
logic |
|
computerwetenschappen |
|
computer sciences |
|
computational science |
|
kunstmatige intelligentie |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and author index |
| In |
Springer eBooks |
| Subject |
Machine theory -- Congresses
|
|
Formal languages -- Congresses
|
|
Mathematical linguistics -- Congresses
|
|
Artificial intelligence -- Congresses
|
|
Electronic Data Processing
|
|
Computers
|
|
Algorithms
|
|
Artificial Intelligence
|
|
Software
|
|
data processing.
|
|
computer science.
|
|
software.
|
|
artificial intelligence.
|
|
computers.
|
|
algorithms.
|
|
Informatique.
|
|
Artificial intelligence
|
|
Formal languages
|
|
Machine theory
|
|
Mathematical linguistics
|
| Genre/Form |
Conference papers and proceedings
|
|
Software.
|
| Form |
Electronic book
|
| Author |
Horia Dediu, Adrian.
|
|
Martín Vide, Carlos.
|
| ISBN |
9783642283321 |
|
3642283322 |
|
