scientific article; zbMATH DE number 3353192
From MaRDI portal
Publication:5628039
zbMath0222.94064MaRDI QIDQ5628039
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (78)
State complexity of permutation on finite languages over a binary alphabet ⋮ A Study of a Simple Class of Modifiers: Product Modifiers ⋮ Operations on Permutation Automata ⋮ State complexity of projection on languages recognized by permutation automata and commuting letters ⋮ Descriptional Complexity of Input-Driven Pushdown Automata ⋮ State complexity of operations on input-driven pushdown automata ⋮ Performing regular operations with 1-limited automata ⋮ Complexity of suffix-free regular languages ⋮ Quotient complexity of closed languages ⋮ State complexity of star of union and square of union on \textit{k} regular languages ⋮ Counting (Watson-Crick) palindromes in Watson-Crick conjugates ⋮ State complexity of combined operations for suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ The exact state complexity for the composition of root and reversal ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ State complexity of pattern matching in regular languages ⋮ Kleene closure and state complexity ⋮ State complexity of inversion operations ⋮ Operational state complexity of unary NFAs with finite nondeterminism ⋮ Unambiguous finite automata over a unary alphabet ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ State complexity of the concatenation of regular tree languages ⋮ Unnamed Item ⋮ Operational state complexity revisited: the contribution of monsters and modifiers ⋮ Operational complexity: NFA-to-DFA trade-off ⋮ On the gap between separating words and separating their reversals ⋮ Operational complexity in subregular classes ⋮ State complexity of cyclic shift ⋮ Operations on Boolean and Alternating Finite Automata ⋮ Concatenation of regular languages and descriptional complexity ⋮ State complexity of combined operations with two basic operations ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ State complexity of operations on two-way finite automata over a unary alphabet ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Frobenius Problem and Its Generalizations ⋮ The Average State Complexity of the Star of a Finite Set of Words Is Linear ⋮ On the State Complexity of Operations on Two-Way Finite Automata ⋮ Descriptional Complexity of the Forever Operator ⋮ Operations on Unambiguous Finite Automata ⋮ Block reversal on finite words ⋮ On the state complexity of operations on two-way finite automata ⋮ Further closure properties of input-driven pushdown automata ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages ⋮ Syntactic complexity of regular ideals ⋮ Formal languages over GF(2) ⋮ Power, positive closure, and quotients on convex languages ⋮ State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal ⋮ State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet ⋮ State complexity of deletion and bipolar deletion ⋮ Square on Deterministic, Alternating, and Boolean Finite Automata ⋮ State Complexity of Catenation Combined with Union and Intersection ⋮ Complexity of proper prefix-convex regular languages ⋮ Operations on Unambiguous Finite Automata ⋮ State complexity of power ⋮ State complexity of unique rational operations ⋮ The complexity of concatenation on deterministic and alternating finite automata ⋮ Concatenation of Regular Languages and Descriptional Complexity ⋮ Unnamed Item ⋮ Self-Verifying Finite Automata and Descriptional Complexity ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Descriptional complexity of regular languages ⋮ Primitivity, uniform minimality, and state complexity of Boolean operations ⋮ The State Complexity of Permutations on Finite Languages over Binary Alphabets ⋮ Star-Complement-Star on Prefix-Free Languages ⋮ State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures ⋮ State complexity of unambiguous operations on finite automata ⋮ Commutative regular languages with product-form minimal automata ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages ⋮ State complexity of union and intersection on graph-walking automata ⋮ State Complexity of Overlap Assembly ⋮ On the boundary of regular languages ⋮ Combination of roots and Boolean operations: an application to state complexity ⋮ Maximal state complexity and generalized de Bruijn words ⋮ State complexity of GF(2)-operations on unary languages ⋮ State complexity of permutation and related decision problems on alphabetical pattern constraints
This page was built for publication:
