Acyclic automata and small expressions using multi-tilde-bar operators

McNaughton, 1960, Regular expressions and state graphs for automata, IEEE Trans. Electron. Comput., 9, 39, 10.1109/TEC.1960.5221603 Glushkov, 1960, On a synthesis algorithm for abstract automata, Ukr. Matem. Zhurnal, 12, 147 Brzozowski, 1963, Signal flow graph techniques for sequential circuit state diagrams, IEEE Trans. Electron. Comput., EC-12, 67, 10.1109/PGEC.1963.263416 Champarnaud, 2001, From c-continuations to new quadratic algorithms for automata synthesis, Internat. J. Algebra Comput., 11, 707, 10.1142/S0218196701000772 Ilie, 2003, Follow automata, Inf. Comput., 186, 140, 10.1016/S0890-5401(03)00090-7 Delgado, 2004, Approximation to the smallest regular expression for a given regular language, vol. 3317, 312 Han, 2007, Obtaining shorter regular expressions from finite-state automata, Theoret. Comput. Sci., 370, 110, 10.1016/j.tcs.2006.09.025 Ellul, 2005, Regular expressions: new results and open problems, J. Autom. Lang. Comb., 10, 407 Ziadi, 1996, Regular expression for a language without empty word, Theoret. Comput. Sci., 163, 309, 10.1016/0304-3975(96)00028-X Gelade, 2008, Succinctness of the complement and intersection of regular expressions, vol. 08001, 325 Gruber, 2008, Finite automata, digraph connectivity, and regular expression size, vol. 5126, 39 H. Gruber, M. Holzer, Language operations with regular expressions of polynomial size, in: G.P.C. Câmpeanu (Ed.), 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS ’08, Charlottetown, Canada, 2008, pp. 182–193. Caron, 2000, Characterization of Glushkov automata, Theoret. Comput. Sci., 233, 75, 10.1016/S0304-3975(97)00296-X Caron, 2009, A new family of regular operators fitting with the position automaton computation, vol. 5404, 645 Caron, 2009, Multi-tilde operators and their Glushkov automata, vol. 5457, 290 Hopcroft, 1979 Yu, 1997, Regular languages, 41