Abstractions of Random Finite-State Machines
Formal Methods in System Design
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Preprocessing for Unification Parsing of Spoken Language
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
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
NFA reduction algorithms by means of regular inequalities
Theoretical Computer Science - Developments in language theory
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Weak minimization of DFA: an algorithm and applications
Theoretical Computer Science - Implementation and application of automata
Bideterministic automata and minimal representations of regular languages
Theoretical Computer Science - Implementation and application of automata
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Discrete Optimization Problems - Some New Heuristic Approaches
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Inductive bases and their application to searches for minimal unary NFAs
Proceedings of the 44th annual Southeast regional conference
On size reduction techniques for multitape automata
Theoretical Computer Science - Implementation and application of automata
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Succinct description of regular languages by weak restarting automata
Information and Computation
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Dr. Multicast: Rx for data center communication scalability
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Edge-RMP: Minimizing administrative assignments for role-based access control
Journal of Computer Security
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Theoretical Computer Science
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Compact Normal Form for Regular Languages as Xor Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Implementation of State Elimination Using Heuristics
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
NFA reduction algorithms by means of regular inequalities
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Minimizing finite automata is computationally hard
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Bideterministic automata and minimal representations of regular languages
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Weak minimization of DFA: an algorithm and applications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
On the size of the universal automaton of a regular language
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Slicing of component behavior specification with respect to their composition
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
Schema design for XML repositories: complexity and tractability
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Descriptional and computational complexity of finite automata---A survey
Information and Computation
The efficiency of identifying timed automata and the power of clocks
Information and Computation
Better hyper-minimization: not as fast, but fewer errors
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
On language decompositions and primality
Rainbow of computer science
Journal of Computer and System Sciences
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Minimizing tree automata for unranked trees
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
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
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Visualising larger state spaces in ProB
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Shorter regular expressions from finite-state automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Minimal DFA for symmetric difference NFA
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Brzozowski's minimization algorithm: more robust than expected
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.00 |