Danièle Beauquier - Concepedia

Author

Danièle Beauquier

Also Known As

Beauquier, Daniele, Beauquier, Danièle, D. BEAUQUIER, D. Beauquier, Danièle Beauquier, Danièle Beauquier, Daniéle Beauquier

Publications

734

Citations

H-Index

Concepts

All Affiliations

Université Paris Cité Université Paris-Est Créteil Sorbonne Université Paris-Est Sup University of Insubria

About

Danièle Beauquier is an author at Université Paris Cité specializing in engineering, formal methods, and automated reasoning.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	9	9	241
2	Computer Science	6	6	160
3	Language Studies	3	3	89
4	Linguistics	3	3	89
5	Natural Sciences	2	2	169

Danièle Beauquier

Publications

504

Citations

H-Index

Page 1

	Year	Citations
On translating one polyomino to tile the plane Danièle Beauquier, Maurice Nivat Discrete & Computational Geometry Geometric ModelingDiscrete GeometryGeometric AlgorithmNatural SciencesDiscrete Mathematics	1991	111
On probabilistic timed automata Danièle Beauquier Theoretical Computer Science Logical AutomatonEngineeringAutomated ReasoningFormal MethodsAutomaton Operation	2003	85
Tiling figures of the plane with two bars Danièle Beauquier, Maurice Nivat, Éric Rémila, Computational Geometry Geometric ModelingDiscrete GeometryEngineeringGeometric AlgorithmGeometry	1995	58
Languages and scanners Danièle Beauquier, Jean-Éric Pin Theoretical Computer Science Applied LinguisticsLanguage DocumentationMultilingualismComputational LinguisticsLanguage Localisation	1991	55
Polyomino tilings, cellular automata and codicity Philippe Aigrain, Danièle Beauquier Theoretical Computer Science Combinatorics On WordPattern FormationCellular AutomatonTopological CombinatoricsDiscrete Mathematics	1995	33
A codicity undecidable problem in the plane Danièle Beauquier, Maurice Nivat Theoretical Computer Science Automated ReasoningSet-theoretic TopologyFoundation Of MathematicsDiscrete MathematicsCodicity Undecidable Problem	2003	30
A first order logic for specification of timed algorithms: basic properties and a decidable class Danièle Beauquier, Anatol Slissenko Annals of Pure and Applied Logic Decidable ClassDecision ProcedureFormal SpecificationEngineeringAutomated Reasoning	2001	23
Minimal automation for a factorial, transitive, and rational language Danièle Beauquier Theoretical Computer Science SyntaxAutomated ReasoningGrammatical FormalismComputational LinguisticsFormal Syntax	1989	22
Security Policies Enforcement Using Finite Edit Automata Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte Electronic Notes in Theoretical Computer Science EngineeringInformation SecurityVerificationPushdown AutomatonFinite Edit Automaton	2009	15
Security policies enforcement using finite and pushdown edit automata Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte International Journal of Information Security EngineeringInformation SecurityFormal MethodsSecurityPushdown Automaton	2013	13

Page 1