scientific article
From MaRDI portal
Publication:2731279
zbMath0978.68087MaRDI QIDQ2731279
Publication date: 31 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Closure properties and descriptional complexity of deterministic regular expressions ⋮ State complexity of permutation on finite languages over a binary alphabet ⋮ The chop of languages ⋮ Topological entropy of formal languages ⋮ A Study of a Simple Class of Modifiers: Product Modifiers ⋮ State complexity of combined operations ⋮ Syntactic complexity of bifix-free languages ⋮ 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 ⋮ State complexity of combined operations for suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ The genus of regular languages ⋮ Cellular Automata: Descriptional Complexity and Decidability ⋮ Syntactic complexity of suffix-free languages ⋮ Descriptional complexity of limited automata ⋮ State complexity of combined operations with two basic operations ⋮ Nondeterministic state complexity of star-free languages ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Unnamed Item ⋮ Distributed XML design ⋮ Transition complexity of language operations ⋮ State complexity of basic language operations combined with reversal ⋮ Lower bounds for the transition complexity of NFAs ⋮ Finite automata with undirected state graphs ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ On the descriptional complexity of finite automata with modified acceptance conditions ⋮ State complexity of some operations on binary regular languages ⋮ Complementing unary nondeterministic automata ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Estimation of state complexity of combined operations ⋮ Operational state complexity of nested word automata ⋮ Succinctness of regular expressions with interleaving, intersection and counting ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Syntactic complexity of regular ideals ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages ⋮ State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal ⋮ Operational Accepting State Complexity: The Unary and Finite Case ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ State Complexity of Combined Operations for Prefix-Free Regular Languages ⋮ On the number of active states in finite automata ⋮ State Complexity of Catenation Combined with Union and Intersection ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Unnamed Item ⋮ Unrestricted State Complexity of Binary Operations on Regular Languages ⋮ On the State Complexity of the Shuffle of Regular Languages ⋮ Descriptional Complexity of Bounded Regular Languages ⋮ State complexity of basic operations on suffix-free regular languages ⋮ Syntactic complexity of bifix-free regular languages ⋮ Descriptional complexity of regular languages ⋮ Upper Bound on Syntactic Complexity of Suffix-Free Languages ⋮ On Simulation Cost of Unary Limited Automata ⋮ Combination of roots and Boolean operations: an application to state complexity
