DEVELOPMENTS IN LANGUAGE THEORY II
The Table of Contents for the full book PDF is as follows:
Preface
SEQUENCES AND CODES
A Family of p-Uniform Tag Systems for p-Paperfolding Sequences
Recent Results on Sturmian Words
Special Factors of Sequences with Linear Subword Complexity
Cantor Sets and Dejean's Conjecture
On Disjunctivity, Ultimate Periodicity and Ultimate Identity of Păun-Salomaa Self-Reading Sequences
Colored Gauss and Tangent Codes on the Torus
Binary Self-Adding Sequences
CLASSICAL THEORY OF LANGUAGES AND AUTOMATA
The Orthogonality of Some Complexity Measures of Context-Free Languages
Time-Bounded Parallel Rewriting
On Emptiness and Counting for Alternating Finite Automata
Height Functions and Linear Languages
Restarting Automata, Marcus Grammars and Context-Free Languages
An Undecidable Problem for Shuffle Languages
Morphisms and Associated Congruences
Rational and Algebraic Languages with Distributed Catenation
On F-Prime Solutions of the Post Correspondence Problem
(0, 1)-Total Pure Context-Free Grammars
Nondeterminism Degrees for Context-Free Languages
Counter-Free Automata, First-Order Logic and Star-Free Expressions Extended by Prefix Oracles
Transforming a Single-Valued Transducer Into a Mealy Machine
CONTROLLED DERIVATIONS AND GRAMMAR SYSTEMS
Colonies as Systems of Turing Machines Without States
Accepting Grammars and Systems: An Overview
The Computational Complexity of PCGS with Regular Components
Array Grammars with Prescribed Teams of Array Productions
On Partition Limited 0L Systems
On the Comunication Complexity of Distributive Language Generation
Szilard Languages Associated to Parallel Communicating Grammar Systems
Imposing Vertical Context Conditions on Derivations
The Membership Problem for Unordered Vector Languages
MANY DIMENSIONS AND GRAPHS
Computing an Upper Bound for SVS(gg) by Abstract Interpretation
On the Connectedness of Pictures Defined by Iterated Function Systems
Finite State Recognizability for Two-Dimensional Languages: A Brief Survey
Efficient Subgraph Matching Within Cellular Hypergraphs
Timed Attribute Hypergraph Grammars and Their Basic Properties
Some New Decision Results for Edge Grammars
INFINITE WORDS
Prefix and Period Languages of Rational ω-Languages
On the Computational Complexity of Infinite Words
Finite Acceptance of Infinite Words
LANGUAGES AND CONCURRENCY
Recent Developments in Trace Theory
Trace Languages Definable with Modular Quantifiers
Hierarchies of Petri Net Languages and a Super-Normal Form
OTHER DEVICES
Rule Space Transformations and One-Dimensional Cellular Automata
Real-Time One-Way Pushdown Cellular Automata Languages
Neural Language Acceptors
APPLICATIONS
Towards Robustness in Parsing — Fuzzifying Context-Free Language Recognition
From Synonymy to Self-Modifying Automata: Q-Diam Language
A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning
Introducing the Operatorial Parser
Reversible Pushdown Automata and Bidirectional Parsing
A Finitary-Language Semantics for Propositional Linear Temporal Logic
Author Index
