FA Minimisation Heuristics for a Class of Finite Languages

Authors:
Jérôme Amilhastre;Philippe Janssen;Marie-Catherine Vilarem
Affiliations:
-;-;-
Venue:
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Year:
1999

Citing 5
Cited 10

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Minimal NFA problems are hard

SIAM Journal on Computing
Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs

Discrete Applied Mathematics
On the State Minimization of Nondeterministic Finite Automata

IEEE Transactions on Computers
Incremental construction of minimal acyclic finite state automata and transducers

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing

NFA reduction algorithms by means of regular inequalities

Theoretical Computer Science - Developments in language theory
On the average state and transition complexity of finite languages

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
Reformulating Global Grammar Constraints

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
NFA reduction algorithms by means of regular inequalities

DLT'03 Proceedings of the 7th 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
Knowledge Compilation Using Interval Automata and Applications to Planning

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Reducing nondeterministic finite automata with SAT solvers

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Descriptional and computational complexity of finite automata---A survey

Information and Computation
Representing CSPs with set-labeled diagrams: a compilation map

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we deal with minimization of finite automata associated with finite languages all the words have the same length. This problem arises in the context of Constraint Satisfaction Problems, widely used in AI. We first give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the definition of minimization heuristics, and describe some experimental results.