Author:
Domaratzki Michael,Pighizzini Giovanni,Shallit Jeffrey
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference19 articles.
1. Tight lower bounds for the length of word chains;Althöfer;Inform. Process. Lett.,1990
2. On the length of word chains;Berstel;Inform. Process. Lett.,1987
3. Intersection and union of regular languages and state complexity;Birget;Inform. Process. Lett.,1992
4. Finite automata and unary languages;Chrobak;Theoret. Comput. Sci.,1986
5. Separating words with small grammars;Currie;J. Automat. Languages Combin.,1999
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Way Machines and de Bruijn Words;Implementation and Application of Automata;2023
2. Operational State Complexity under Parikh Equivalence;Descriptional Complexity of Formal Systems;2014
3. Descriptional Complexity of Input-Driven Pushdown Automata;Lecture Notes in Computer Science;2012
4. Finite state complexity;Theoretical Computer Science;2011-09
5. Chrobak Normal Form Revisited, with Applications;Implementation and Application of Automata;2011