Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Champarnaud, Jean-Marc
and
Ziadi, Djelloul
2001.
Combinatorial Pattern Matching.
Vol. 2089,
Issue. ,
p.
157.
Héam, Pierre-Cyrille
2002.
On Shuffle Ideals.
RAIRO - Theoretical Informatics and Applications,
Vol. 36,
Issue. 4,
p.
359.
Iliea, Lucian
and
Yu, Sheng
2002.
Mathematical Foundations of Computer Science 2002.
Vol. 2420,
Issue. ,
p.
328.
Ilie, Lucian
and
Yu, Sheng
2002.
Combinatorial Pattern Matching.
Vol. 2373,
Issue. ,
p.
279.
Ilie, Lucian
and
Yu, Sheng
2003.
Reducing NFAs by invariant equivalences.
Theoretical Computer Science,
Vol. 306,
Issue. 1-3,
p.
373.
Lifshits, Yuri
2003.
A lower bound on the size of ε-free NFA corresponding to a regular expression.
Information Processing Letters,
Vol. 85,
Issue. 6,
p.
293.
Ilie, Lucian
and
Yu, Sheng
2003.
Follow automata.
Information and Computation,
Vol. 186,
Issue. 1,
p.
140.
Seibert, Sebastian
2003.
Developments in Language Theory.
Vol. 2450,
Issue. ,
p.
28.
Ilie, Lucian
Navarro, Gonzalo
and
Yu, Sheng
2004.
Theory Is Forever.
Vol. 3113,
Issue. ,
p.
112.
Champarnaud, Jean-Marc
Nicart, Florent
and
Ziadi, Djelloul
2005.
Implementation and Application of Automata.
Vol. 3317,
Issue. ,
p.
90.
Emir, Burak
2005.
Compiling regular patterns to sequential machines.
p.
1385.
Ilie, Lucian
Solis-Oba, Roberto
and
Yu, Sheng
2005.
Combinatorial Pattern Matching.
Vol. 3537,
Issue. ,
p.
310.
Schnitger, Georg
2006.
STACS 2006.
Vol. 3884,
Issue. ,
p.
432.
Sakarovitch, Jacques
2006.
Implementation and Application of Automata.
Vol. 3845,
Issue. ,
p.
15.
Salomaa, Kai
Yu, Sheng
and
Zan, Jinfeng
2007.
Implementation and Application of Automata.
Vol. 4783,
Issue. ,
p.
97.
Ouardi, Faissal
and
Ziadi, Djelloul
2008.
Efficient weighted expressions conversion.
RAIRO - Theoretical Informatics and Applications,
Vol. 42,
Issue. 2,
p.
285.
Holzer, Markus
and
Kutrib, Martin
2008.
Implementation and Applications of Automata.
Vol. 5148,
Issue. ,
p.
1.
Domaratzki, Michael
and
Salomaa, Kai
2008.
Lower bounds for the transition complexity of NFAs.
Journal of Computer and System Sciences,
Vol. 74,
Issue. 7,
p.
1116.
HOLZER, MARKUS
and
KUTRIB, MARTIN
2009.
NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY.
International Journal of Foundations of Computer Science,
Vol. 20,
Issue. 04,
p.
563.
Salomaa, Kai
Yu, Sheng
and
Zan, Jinfeng
2009.
Deciding determinism of caterpillar expressions.
Theoretical Computer Science,
Vol. 410,
Issue. 37,
p.
3438.