Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Journal of Computer and System Sciences
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science
Random generation models for NFA'S
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Transition complexity of language operations
Theoretical Computer Science
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
A New Family of Regular Operators Fitting with the Position Automaton Computation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Multi-tilde Operators and Their Glushkov Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Regular language constrained sequence alignment revisited
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
On a maximal NFA without mergible states
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
NFAs with and without ε-transitions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Computing the follow automaton of an expression
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Performance guarantees for distributed reachability queries
Proceedings of the VLDB Endowment
| Hi-index | 0.01 |