Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Hadrien Jeanne"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 1, Iss Combinatorics (2013)
Combinatorics
Externí odkaz:
https://doaj.org/article/717d4aa4b0e64f8da1ccdd7d36d8f4b0
Publikováno v:
International Journal of Foundations of Computer Science. 20:763-774
Our aim is to present an efficient algorithm that checks whether a binary regular language is geometrical or not, based on specific properties of its minimal deterministic automaton. Geometrical languages have been introduced in the framework of off-
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, 15 (2), pp.95--120
CoRR
CoRR, 2012, abs/1205.1825
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 2 (2), pp.95--120
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, 15 (2), pp.95--120
CoRR
CoRR, 2012, abs/1205.1825
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 2 (2), pp.95--120
Automata, Logic and Semantics
Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on
Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::036c68ee7c62589f2b2b7dddb10406c1
https://hal-normandie-univ.archives-ouvertes.fr/hal-02335290
https://hal-normandie-univ.archives-ouvertes.fr/hal-02335290
Publikováno v:
The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, Open Journal Systems, 2013, 20 (4), pp.P26
The Electronic Journal of Combinatorics, Open Journal Systems, 2013, 20 (4), pp.P26
The aim of this paper is to gather several results concerning the enumeration of specific classes of polycubes. We first consider two classes of $3$-dimensional vertically-convex directed polycubes: the plateau polycubes and the parallelogram polycub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::928d20da76a81432eaabe762567ff205
https://hal.archives-ouvertes.fr/hal-00916097
https://hal.archives-ouvertes.fr/hal-00916097
Publikováno v:
Fundamenta Informaticae
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2015, 137 (4), pp.425--455. ⟨10.3233/FI-2015-1189⟩
Lecture Notes in Computer Science
Language and Automata Theory and Applications-7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings
LATA 2013
LATA 2013, Apr 2013, Bilbao, Spain. pp.202-213
CoRR
CoRR, 2013, abs/1301.3316
Language and Automata Theory and Applications ISBN: 9783642370632
LATA
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2015, 137 (4), pp.425--455. ⟨10.3233/FI-2015-1189⟩
Lecture Notes in Computer Science
Language and Automata Theory and Applications-7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings
LATA 2013
LATA 2013, Apr 2013, Bilbao, Spain. pp.202-213
CoRR
CoRR, 2013, abs/1301.3316
Language and Automata Theory and Applications ISBN: 9783642370632
LATA
The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b4a70b7c412c5014957b468340b8656
https://hal.archives-ouvertes.fr/hal-00906817
https://hal.archives-ouvertes.fr/hal-00906817
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2012, 449, pp.54-63
Theoretical Computer Science, Elsevier, 2012, 449, pp.54-63
International audience; Given an arbitrarily large alphabet Σ, we consider the family of regular languages over Σ for which the deterministic minimal automaton has a strongly connected state diagram. We present a new method for checking whether suc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80f3d26f0667da5abe9d08bf6a80aa70
https://hal.archives-ouvertes.fr/hal-00906811
https://hal.archives-ouvertes.fr/hal-00906811
Autor:
Jean-Marc Champarnaud, Hadrien Jeanne, Marie-Pierre Béal, Jean-Philippe Dubernard, Sylvain Lombardy
Publikováno v:
Lecture Notes in Computer Science
Developments in Language Theory
16th International Conference, DLT 2012
16th International Conference, DLT 2012, 2012, Taipei, Taiwan. pp.62-72, ⟨10.1007/978-3-642-31653-1_7⟩
Developments in Language Theory ISBN: 9783642316524
Developments in Language Theory
16th International Conference, DLT 2012
16th International Conference, DLT 2012, 2012, Taipei, Taiwan. pp.62-72, ⟨10.1007/978-3-642-31653-1_7⟩
Developments in Language Theory ISBN: 9783642316524
International audience; Geometrical languages generalize languages introduced to model temporal validation of real-time softwares. We prove that it is decidable whether a regular language is geometrical. This result was previously known for binary la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43dd1e39700088305e22b71636e29cc6
https://hal.archives-ouvertes.fr/hal-00737688/file/geometriqueDLT2012.pdf
https://hal.archives-ouvertes.fr/hal-00737688/file/geometriqueDLT2012.pdf
Publikováno v:
Lecture Notes in Computer Science
Descriptional Complexity of Formal Systems-13th International Workshop, DCFS 2011, Giessen/Limburg, Germany, July 25-27, 2011. Proceedings
DCFS 2011
DCFS 2011, Jul 2011, Giessen/Limburg, Germany. pp.107-120
Descriptional Complexity of Formal Systems ISBN: 9783642225994
DCFS
Descriptional Complexity of Formal Systems-13th International Workshop, DCFS 2011, Giessen/Limburg, Germany, July 25-27, 2011. Proceedings
DCFS 2011
DCFS 2011, Jul 2011, Giessen/Limburg, Germany. pp.107-120
Descriptional Complexity of Formal Systems ISBN: 9783642225994
DCFS
International audience; We present a new method for checking whether a regular language over an arbitrarily large alphabet is semi-geometrical or whether it is geometrical. This method makes use first of the partitioning of the state diagram of the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49c5af710b1d6e165ca67a0d6f6825ea
https://hal.archives-ouvertes.fr/hal-00906785
https://hal.archives-ouvertes.fr/hal-00906785
Publikováno v:
Language and Automata Theory and Applications-6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings
Language and Automata Theory and Applications-6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings, 2011, Empty, Germany. pp.179--191, ⟨10.1007/978-3-642-28332-1\_16⟩
Language and Automata Theory and Applications ISBN: 9783642283314
LATA
Language and Automata Theory and Applications-6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings, 2011, Empty, Germany. pp.179--191, ⟨10.1007/978-3-642-28332-1\_16⟩
Language and Automata Theory and Applications ISBN: 9783642283314
LATA
Several studies have been achieved to construct a finite automaton that recognizes the set of words that are at a bounded distance from some word of a given language. In this paper, we introduce a new family of regular operators based on a generaliza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db49304026680dfa0641364f9d1ee452
https://hal-normandie-univ.archives-ouvertes.fr/hal-02335294
https://hal-normandie-univ.archives-ouvertes.fr/hal-02335294
Publikováno v:
Lecture Notes in Computer Science
Implementation and Application of Automata-15th International Conference, CIAA 2010
CIAA 2010
CIAA 2010, Aug 2010, Winnipeg, Canada. pp.69-78
Implementation and Application of Automata ISBN: 9783642180972
CIAA
Implementation and Application of Automata-15th International Conference, CIAA 2010
CIAA 2010
CIAA 2010, Aug 2010, Winnipeg, Canada. pp.69-78
Implementation and Application of Automata ISBN: 9783642180972
CIAA
International audience; We show that if a binary language L is regular, prolongable and geometrical, then it can generate, on certain assumptions, a p1 type tiling of a part of ℕ2. We also show that the sequence of states that appear along a horizo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f81d8de1d975b6a0b8392f3c63b252c3
https://hal.archives-ouvertes.fr/hal-00906773
https://hal.archives-ouvertes.fr/hal-00906773