Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dcfs/PalioudakisCGHK15
%A Palioudakis, Alexandros
%A Cho, Da-Jung
%A Goc, Daniel
%A Han, Yo-Sub
%A Ko, Sang-Ki
%A Salomaa, Kai
%B DCFS
%D 2015
%E Shallit, Jeffrey O.
%E Okhotin, Alexander
%I Springer
%K dblp
%P 220-230
%T The State Complexity of Permutations on Finite Languages over Binary Alphabets.
%U http://dblp.uni-trier.de/db/conf/dcfs/dcfs2015.html#PalioudakisCGHK15
%V 9118
%@ 978-3-319-19224-6
@inproceedings{conf/dcfs/PalioudakisCGHK15,
added-at = {2022-06-23T00:00:00.000+0200},
author = {Palioudakis, Alexandros and Cho, Da-Jung and Goc, Daniel and Han, Yo-Sub and Ko, Sang-Ki and Salomaa, Kai},
biburl = {https://www.bibsonomy.org/bibtex/20c48701c8ce5872324664bde7084eae7/dblp},
booktitle = {DCFS},
crossref = {conf/dcfs/2015},
editor = {Shallit, Jeffrey O. and Okhotin, Alexander},
ee = {https://doi.org/10.1007/978-3-319-19225-3_19},
interhash = {19b0899e951a852bfdabad02830f8d1f},
intrahash = {0c48701c8ce5872324664bde7084eae7},
isbn = {978-3-319-19224-6},
keywords = {dblp},
pages = {220-230},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T13:38:54.000+0200},
title = {The State Complexity of Permutations on Finite Languages over Binary Alphabets.},
url = {http://dblp.uni-trier.de/db/conf/dcfs/dcfs2015.html#PalioudakisCGHK15},
volume = 9118,
year = 2015
}