Developments in language theory

Más información sobre el libro

This collection features a range of invited and regular papers exploring various topics in theoretical computer science. It begins with discussions on reaction systems, inspired by biochemistry, and delves into tiling recognizable two-dimensional languages. The complexity of regular-like expressions and decision problems for simple and parameterized machines are also examined. The implications of DNA computing for theoretical computer science are highlighted, alongside the connection between numeration systems, number theory, and formal language theory. Regular papers cover algorithmic properties of millstream systems, conjectures related to algebraic observational equivalence, and undecidability results for parallel communicating finite automata. The collection addresses inclusion problems for patterns with limited variables and the average number of states in partial derivative automata. It also explores the hybrid ? erný-road coloring problem, Hamiltonian paths, and methods for computing blocker sets in regular post embedding problems. Further topics include rankers over infinite words, Kleene and Büchi theorems for weighted automata, and minimization of deterministic bottom-up tree transducers. The papers discuss periodicity in morphic words, compressed conjugacy, and the word problem for outer automorphism groups of graph groups. Additionally, the collection includes insights into parallel Boolean algebra, complexity in