E-Books durchsuchen

Mutually Accepting Capacitated Automata

Bad Pictures: Some Structural Properties Related to Overlaps

Regular Expression Length via Arithmetic Formula Complexity

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

On the Power of Generalized Forbidding Insertion-Deletion Systems

State Complexity Bounds for the Commutative Closure of Group Languages

Multiple Concatenation and State Complexity (Extended Abstract)

Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata

Longer Shortest Strings in Two-Way Finite Automata

Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

Descriptional Complexity of Winning Sets of Regular Languages

State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

Complexity of Two-Dimensional Rank-Reducing Grammars

Palindromic Length of Words with Many Periodic Palindromes

Operational Complexity of Straight Line Programs for Regular Languages

Classifying <inline-formula><alternatives><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>-Regular Aperiodic <italic>k</italic>-Partitions

Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata

On the Generative Power of Quasiperiods

Insertion-Deletion with Substitutions II