Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
FA Minimisation Heuristics for a Class of Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Efficient context-free grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Decomposing global grammar constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The theory of grammar constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint programming based column generation for employee timetabling
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Explaining propagators for s-DNNF circuits
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Space-Time tradeoffs for the regular constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a context-free grammar respectively. Taking advantage of the fixed length of the constraint, we give an algorithm to transform a context-free grammar into an automaton. We then study the use of minimization techniques to reduce the size of such automata and speed up propagation. We show that minimizing such automata after they have been unfolded and domains initially reduced can give automata that are more compact than minimizing before unfolding and reducing. Experimental results show that such transformations can improve the size of rostering problems that we can "model and run".