scientific article; zbMATH DE number 2068872
From MaRDI portal
Publication:4465331
zbMATH Open1095.68605MaRDI QIDQ4465331FDOQ4465331
Authors: Michael Domaratzki 
Publication date: 27 May 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (32)
- 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
- State complexity of union and intersection of star on \(k\) regular languages
- State complexity of combined operations with two basic operations
- Combination of roots and Boolean operations: an application to state complexity
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- State complexity of cyclic shift
- The state complexity of permutations on finite languages over binary alphabets
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- State complexity of basic operations on suffix-free regular languages
- State Complexity of Deletion
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- State complexity of some operations on binary regular languages
- Decimations of languages and state complexity
- State complexity of deletion and bipolar deletion
- New tools for state complexity
- On the average state and transition complexity of finite languages
- Deletion along trajectories
- Operational state complexity revisited: the contribution of monsters and modifiers
- Estimation of state complexity of combined operations
- State complexity of combined operations
- State complexity of four combined operations composed of union, intersection, star and reversal
- Nondeterministic state complexity of proportional removals
- Nondeterministic complexity in subclasses of convex languages
- Concatenation of Regular Languages and Descriptional Complexity
- Title not available (Why is that?)
- A Study of a Simple Class of Modifiers: Product Modifiers
- Concatenation of regular languages and descriptional complexity
- Nondeterministic operational complexity in subregular languages
- Further closure properties of input-driven pushdown automata
- Provably Shorter Regular Expressions from Deterministic Finite Automata
- Nondeterministic state complexity of proportional removals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4465331)
