Florent Nicart

Orcid: 0009-0001-2663-4306

According to our database1, Florent Nicart authored at least 23 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constrained Multi-Tildes: Derived Term and Position Automata.
CoRR, 2024

2023
Monadic Expressions and their Derivatives [extended version].
CoRR, 2023

Constrained Multi-Tildes.
Proceedings of the Implementation and Application of Automata, 2023

2022
Monadic Expressions and their Derivatives.
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

2016
Constrained Expressions and their Derivatives.
Fundam. Informaticae, 2016

Operads, quasiorders, and regular languages.
Adv. Appl. Math., 2016

2013
Some Combinatorial Operators in Language Theory.
J. Autom. Lang. Comb., 2013

2011
NOAM: news outlets analysis and monitoring system.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

2010
Finding surprising patterns in textual data streams.
Proceedings of the 2nd International Workshop on Cognitive Information Processing, 2010

2008
Towards scalable virtuality in C++.
Softw. Pract. Exp., 2008

Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines.
Int. J. Found. Comput. Sci., 2008

2007
Labelling Multi-Tape Automata with Constrained Symbol Classes.
Int. J. Found. Comput. Sci., 2007

2006
From the ZPC Structure of a Regular Expression to its Follow Automaton.
Int. J. Algebra Comput., 2006

Multi-tape Automata with Symbol Classes.
Proceedings of the Implementation and Application of Automata, 2006

2005
A Class of Rational <i>n</i>-WFSM Auto-intersections.
Proceedings of the Implementation and Application of Automata, 2005

WFSM Auto-intersection and Join Algorithms.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2004
Acyclic networks maximizing the printing complexity.
Theor. Comput. Sci., 2004

Algorithms for weighted multi-tape automata
CoRR, 2004

Computing the Follow Automaton of an Expression.
Proceedings of the Implementation and Application of Automata, 2004

2003
Virtual Operations On Virtual Networks: The Priority Union .
Int. J. Found. Comput. Sci., 2003

WFSC - A New Weighted Finite State Compiler.
Proceedings of the Implementation and Application of Automata, 2003

Running Time Complexity of Printing an Acyclic Automaton.
Proceedings of the Implementation and Application of Automata, 2003

2002
Finite State Lazy Operations in NLP.
Proceedings of the Implementation and Application of Automata, 2002


  Loading...