|
On birooted words
- Two-way automata and regular languages of overlapping tiles
(with
A. Dicky),
Fundamenta Informaticae
141:311-343,
2015
(doi)
(hal)
(pdf).
- Inverse monoids of higher-dimensional strings,
in #ictac#, #lncs# 9399, 2015 (hal)
(pdf).
- Free inverse monoids up to rewriting,
,
{LaBRI}, Universit\'e de Bordeaux,
2015
(url)
.
- Embedding finite and infinite words into overlapping tiles
(with
A. Dicky),
in #dlt#, #lncs# 8633, pp 339--347, 2014
(doi)
(hal)
(pdf).
- Algebraic tools for the overlapping tile product
(with
E. Dubourg),
in #lata#, #lncs# 8370, pp 335 -- 346, 2014
(doi)
(hal)
(pdf).
invited,tree, word, graph, MSO, birooted, adequate, language, application
2014
bc
hal-00879463
Novy Smokovec, Slovaquia
Towards a higher dimensional string theory for the modeling of computerized systems
RR-1477-13
V. Geffert et al.
http://hal.archives-ouvertes.fr/hal-00879463
01
8327
7--20
#lncs#
Jan14a
#springer#
http:./Talks/Sofsem2014.pdf
#sofsem#
10.1007/978-3-319-04298-5_2
- On languages of one-dimensional overlapping tiles,
in #sofsem#, #lncs# 7741, pp 244-256, 2013
(doi)
(hal)
(pdf).
- Overlaping tile automata,
in 8th Int. Computer Science Symp. in Russia ({CSR}), #lncs# 7913, pp 431--443, 2013
(doi)
(hal)
(pdf).
- Quasi-recognizable vs {MSO} definable languages of one-dimensional overlapping tiles,
in #mfcs#, #lncs# 7464, pp 516-528, 2012
(doi)
(hal)
(pdf).
- Quasi-inverse monoids (and premorphisms),
,
LaBRI, Universit\'e de Bordeaux,
2012
(url)
.
|