scientific article; zbMATH DE number 2050931
From MaRDI portal
Publication:4453205
zbMATH Open1103.68583MaRDI QIDQ4453205FDOQ4453205
Authors: Galina Jirásková 
Publication date: 7 March 2004
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2068869
- On the non-deterministic communication complexity of regular languages
- On the Non-deterministic Communication Complexity of Regular Languages
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
- Communication complexity method for measuring nondeterminism in finite automata
Cited In (11)
- Complement on Free and Ideal Languages
- Title not available (Why is that?)
- Lifting query complexity to time-space complexity for two-way finite automata
- Nondeterministic Complexity of Operations on Closed and Ideal Languages
- State complexity of some operations on binary regular languages
- Minimizing evolution communication P systems and automata
- Nondeterministic complexity in subclasses of convex languages
- Limitations of lower bound methods for deterministic nested word automata
- Deterministic blow-ups of minimal NFA's
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Title not available (Why is that?)
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 Q4453205)
