Result 1 to 20 of 22 total
NOAM: news outlets analysis and monitoring system (English)
SIGMOD Conference, 1275-1278 (2011).
1
Towards scalable virtuality in C++. (English)
Softw., Pract. Exper. 38, No. 14, 1451-1473 (2008).
2
Algorithms for the join and auto-intersection of multi-tape weighted finite-state machines. (English)
Int. J. Found. Comput. Sci. 19, No. 2, 453-476 (2008).
3
Towards scalable virtuality in C++ (English)
Softw., Pract. Exper. 38, No. 14, 1451-1473 (2008).
4
Labelling multi-tape automata with constrained symbol classes. (English)
Int. J. Found. Comput. Sci. 18, No. 4, 847-858 (2007).
5
Multi-tape automata with symbol classes. (English)
Ibarra, Oscar H. (ed.) et al., Implementation and application of automata. 11th international conference, CIAA 2006, Taipei, Taiwan, August 21‒23, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-37213-4/pbk). Lecture Notes in Computer Science 4094, 126-136 (2006).
6
A class of rational $n$-WFSM auto-intersections. (English)
Farré, Jacques (ed.) et al., Implementation and application of automata. 10th international conference, CIAA 2005, Sophia Antipolis, France, June 27‒29, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-31023-1/pbk). Lecture Notes in Computer Science 3845, 188-198 (2006).
7
From the $\mathcal{ZPC}$ structure of a regular expression to its follow automaton. (English)
Int. J. Algebra Comput. 16, No. 1, 17-34 (2006).
8
Multi-tape automata with symbol classes (English)
CIAA, 126-136 (2006).
9
Computing the follow automaton of an expression. (English)
Domaratzki, Michael (ed.) et al., Implementation and application of automata. 9th international conference, CIAA 2004, Kingston, Canada, July 22‒24, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24318-6/pbk). Lecture Notes in Computer Science 3317, 90-101 (2005).
10
WFSM auto-intersection and join algorithms (English)
FSMNLP, 120-131 (2005).
11
A class of rational $n$-WFSM auto-intersections (English)
CIAA, 188-198 (2005).
12
Algorithms for weighted multi-tape automata. (English)
Comput. Res. Repos. 2004, Article No. 0406003 (2004).
13
Acyclic networks maximizing the printing complexity. (English)
Theor. Comput. Sci. 328, No. 1-2, 39-51 (2004).
14
Computing the follow automaton of an expression (English)
CIAA, 90-101 (2004).
15
Running time complexity of printing an acyclic automaton. (English)
Ibarra, Oscar H. (ed.) et al., Implementation and application of automata. 8th international conference, CIAA 2003, Santa Barbara, CA, USA, July 16‒18, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40561-5/pbk). Lect. Notes Comput. Sci. 2759, 20-34 (2003).
16
WFSC ‒ a new weighted finite state compiler. (English)
Ibarra, Oscar H. (ed.) et al., Implementation and application of automata. 8th international conference, CIAA 2003, Santa Barbara, CA, USA, July 16‒18, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40561-5/pbk). Lect. Notes Comput. Sci. 2759, 1-14 (2003).
17
Virtual operations on virtual networks: The priority union. (English)
Int. J. Found. Comput. Sci. 14, No. 6, 1055-1069 (2003).
18
Finite state lazy operations in NLP. (English)
Champarnaud, Jean-Marc (ed.) et al., Implementation and application of automata. 7th international conference, CIAA 2002, Tours, France, July 3‒5, 2002. Revised papers. Berlin: Springer (ISBN 3-540-40391-4/pbk). Lect. Notes Comput. Sci. 2608, 138-147 (2003).
19
Running time complexity of printing an acyclic automaton (English)
CIAA, 131-140 (2003).
20
Result 1 to 20 of 22 total
Start
Contact
Print
General Help
