the proceedings contain 40 papers. the special focus in this conference is on language and automatatheory and applications. the topics include: Unary Pattern Avoidance in Partial Words Dense with Holes;Characterizing...
ISBN:
(纸本)9783642212536
the proceedings contain 40 papers. the special focus in this conference is on language and automatatheory and applications. the topics include: Unary Pattern Avoidance in Partial Words Dense with Holes;Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars;partial Derivatives of an Extended Regular Expression;automatic Learning of Subclasses of Pattern languages;finite Orbits of language Operations;finitary languages;the Complexity of Request-Response Games;improved Alignment Based Algorithm for Multilingual Text Compression;singular Artin Monoids of Finite Coxeter Type Are Automatic;automatic Structures and Groups;networks of Evolutionary Processors with Subregular Filters;decision Problems for Interval Markov Chains;classifying Regular languages via Cascade Products of automata;the Block Structure of Successor Morphisms;models for Quantitative Distributed Systems and Multi-Valued Logics;a Local Greibach Normal Form for Hyperedge Replacement Grammars;unique Small Subgraphs Are Not Easier to Find;Simplifying DPDA Using Supplementary Information;normalization of Sequential Top-Down Tree-to-Word Transducers;planarity of Knots, Register automata and LogSpace Computability;vector Addition System Reachability Problem: A Short Self-contained Proof;tarski’s Principle, Categorial Grammars and Learnability;Globally Deterministic CD-Systems of Stateless R(1)-automata;bit-coded Regular Expression Parsing;descriptional Complexity of Unambiguous Nested Word automata;avalanche Structure in the Kadanoff Sand Pile Model;well-Quasi-Ordering Hereditarily Finite Sets;on the Interval-Bound Problem for Weighted Timed automata;finding Shuffle Words that Represent Optimal Scheduling of Shared Memory Access;syntactic Complexity of Ultimately Periodic Sets of Integers;undecidability of the State Complexity of Composed Regular Operations;abstract Numeration Systems;restarting automata with Auxiliary Symbols and Small Lookahead;mutation Systems.
the proceedings contain 40 papers. the topics discussed include: automatic structures and groups;vector addition system reachability problem: a short self-contained proof;abstract numeration systems;classification of ...
ISBN:
(纸本)9783642212536
the proceedings contain 40 papers. the topics discussed include: automatic structures and groups;vector addition system reachability problem: a short self-contained proof;abstract numeration systems;classification of string languages via tiling recognizable picture languages;a simple and efficient universal reversible turning machine;the parameterized complexity of chosen problems for finite automata on trees;unary pattern avoidance in partial words dense with holes;characterizing compressibility of disjoint subgraphs with NLC grammars;partial derivatives of an extended regular expression;automatic learning of subclasses of pattern languages;finite orbits of language operations;the complexity of request-response games;improved alignment based algorithm for multilingual text compression;singular artin monoids of finite coxeter type are automatic;and networks of evolutionary processors with subregular filters.
this book constitutes the refereed proceedings of the 7thinternationalconference on language and automatatheory and applications, LATA 2013, held in Bilbao, Spain in April 2013. the 45 revised full papers presented...
ISBN:
(纸本)9783642370656
this book constitutes the refereed proceedings of the 7thinternationalconference on language and automatatheory 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 languagetheory; algorithms for semi-structured data mining; algorithms on automata and words; automata and logic; automata for system analysis and program verification; 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 artificial 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.
the proceedings contain 26 papers. the special focus in this conference is on language and automatatheory and applications. the topics include: Usefulness of Information and Unary languages;learnability and Positive ...
ISBN:
(纸本)9783030681944
the proceedings contain 26 papers. the special focus in this conference is on language and automatatheory and applications. the topics include: Usefulness of Information and Unary languages;learnability and Positive Equivalence Relations;learning Mealy Machines with One Timer;temporal Logics withlanguage Parameters;commutative Rational Term Rewriting;context-Free Grammars with Lookahead;finite-Word Hyperlanguages;tree-Like Unit Refutations in Horn Constraint Systems;homomorphic Characterization of Tree languages Based on Comma-Free Encoding;partially Directed Animals with a Bounded Number of Holes;approximated Determinisation of Weighted Tree automata;sequentiality of Group-Weighted Tree automata;an Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs;on Balanced Sequences and their Asymptotic Critical Exponent;completely Reachable automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words;state Complexity of the Set of Synchronizing Words for Circular automata and automata over Binary Alphabets;cadences in Grammar-Compressed Strings;On the Computational Power of Programs over BA2 Monoid;location Based automata for Expressions with Shuffle;succinct Representations for (Non)Deterministic Finite automata;optimising Attractor Computation in Boolean automata Networks;on the Transformation of Two-Way Deterministic Finite automata to Unambiguous Finite automata;Deciding Non-emptiness of Hypergraph languages Generated by Connection-preserving Fusion Grammars is NP-complete;on the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits.
the proceedings contain 45 papers. the topics discussed include: measuring information in timed languages;automata-based symbolic representations of polyhedra;around the physical church-turing thesis: cellular automat...
ISBN:
(纸本)9783642283314
the proceedings contain 45 papers. the topics discussed include: measuring information in timed languages;automata-based symbolic representations of polyhedra;around the physical church-turing thesis: cellular automata, formal languages, and the principles of quantum theory;a parameterized complexity tutorial;the computer science of DNA nanotechnology;the minimal cost reachability problem in priced timed pushdown systems;unification modulo chaining;isomorphism testing of boolean functions computable by constant-depth circuits;reversible multi-head finite automata characterize reversible logarithmic space;defining contexts in context-free grammars;longest common extensions via fingerprinting;fast and cache-oblivious dynamic programming with local dependencies;and an efficient implicit OBDD-based algorithm for maximal matchings.
the proceedings contain 48 papers. the topics discussed include: algorithms for analyzing and verifying infinite-state recursive probabilistic systems;recursion schemes, collapsible pushdown automata and higher-order ...
ISBN:
(纸本)9783642370632
the proceedings contain 48 papers. the topics discussed include: algorithms for analyzing and verifying infinite-state recursive probabilistic systems;recursion schemes, collapsible pushdown automata and higher-order model checking;on the complexity of shortest path problems on discounted cost graphs;termination of rule-based calculi for uniform semi-unification;on the construction of a family of automatathat are generically non-minimal;duplication-loss genome alignment: complexity and algorithm;MAT learning of universal automata;a graph polynomial approach to primitivity;dynamic communicating automata and branching high-level MSCs;visibly pushdown automata: universality and inclusion via AntiChains;execution information rate for some classes of automata;decidability and complexity results for verification of asynchronous broadcast networks;and primitive words and Lyndon words in automatic and linearly recurrent sequences.
暂无评论