default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStavros Konstantinidis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j49]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Juraj Sebej:
On the difference set of two transductions. Theor. Comput. Sci. 1016: 114780 (2024)- [i9]Pantelis Andreou, Stavros Konstantinidis, Taylor J. Smith:
Improved Randomized Approximation of Hard Universality and Emptiness Problems. CoRR abs/2403.08707 (2024) - 2023
- [j48]Stavros Konstantinidis, António Machiavelo
, Nelma Moreira, Rogério Reis:
On the average complexity of partial derivative transducers. Theor. Comput. Sci. 956: 113830 (2023) - [j47]Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis:
Approximate NFA universality and related problems motivated by information theory. Theor. Comput. Sci. 972: 114076 (2023) - 2022
- [j46]Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems (DCFS 2019). Inf. Comput. 284: 104686 (2022) - [c28]Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis:
Approximate NFA Universality Motivated by Information Theory. DCFS 2022: 142-154 - [i8]Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis:
Approximate NFA Universality and Related Problems Motivated by Information Theory. CoRR abs/2202.01594 (2022) - 2021
- [j45]Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis:
On the size of partial derivatives and the word membership problem. Acta Informatica 58(4): 357-375 (2021) - [j44]Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej:
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. Int. J. Found. Comput. Sci. 32(5): 455-480 (2021) - [j43]Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. Theor. Comput. Sci. 870: 103-120 (2021) - [c27]Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis:
Partial Derivative Automaton by Compressing Regular Expressions. DCFS 2021: 100-112 - 2020
- [j42]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young:
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. Int. J. Found. Comput. Sci. 31(8): 983-1019 (2020) - [j41]Stavros Konstantinidis:
Every Regular Bifix Code is a Finite Union of Regular Infix Codes. J. Autom. Lang. Comb. 25(1): 55-59 (2020) - [c26]Stavros Konstantinidis:
Theoretical and Implementational Aspects of the Formal Language Server (LaSer). CiE 2020: 289-295 - [c25]Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average State Complexity of Partial Derivative Transducers. SOFSEM 2020: 174-186
2010 – 2019
- 2019
- [j40]Stavros Konstantinidis, Giovanni Pighizzini:
Special section on Descriptional Complexity of Formal Systems. Theor. Comput. Sci. 798: 1 (2019) - [c24]Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej:
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. CIAA 2019: 171-183 - [c23]Stavros Konstantinidis, Nelma Moreira, João Pires, Rogério Reis:
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. CIAA 2019: 184-196 - [e4]Michal Hospodár, Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings. Lecture Notes in Computer Science 11612, Springer 2019, ISBN 978-3-030-23246-7 [contents] - [i7]Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej:
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. CoRR abs/1903.10740 (2019) - 2018
- [j39]Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang:
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers. Algorithms 11(11): 165 (2018) - [j38]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer descriptions of DNA code properties and undecidability of antimorphic problems. Inf. Comput. 259(2): 237-258 (2018) - [j37]Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Randomized generation of error control codes with automata and transducers. RAIRO Theor. Informatics Appl. 52(2-3-4): 169-184 (2018) - [j36]Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis:
Symbolic Manipulation of Code Properties. J. Autom. Lang. Comb. 23(1-3): 243-269 (2018) - [c22]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young:
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels. CIAA 2018: 4-27 - [e3]Stavros Konstantinidis, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings. Lecture Notes in Computer Science 10952, Springer 2018, ISBN 978-3-319-94630-6 [contents] - [i6]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young:
Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels. CoRR abs/1805.01829 (2018) - 2017
- [j35]Stavros Konstantinidis:
Report on DCFS 2017. Bull. EATCS 123 (2017) - [j34]Stavros Konstantinidis, Mitja Mastnak:
Embedding Rationally Independent Languages into Maximal Ones. J. Autom. Lang. Comb. 21(4): 311-338 (2017) - [c21]Stavros Konstantinidis:
Applications of Transducers in Independent Languages, Word Distances, Codes. DCFS 2017: 45-62 - [e2]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Jeffrey O. Shallit:
The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski. World Scientific 2017, ISBN 978-981-3148-19-2 [contents] - 2016
- [j33]Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Stephen Solis-Reyes:
Additive methods for genomic signatures. BMC Bioinform. 17: 313 (2016) - [c20]Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Generating error control codes with automata and transducers. NCMA 2016: 211-226 - [c19]Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis:
Implementation of Code Properties via Transducers. CIAA 2016: 189-201 - [i5]Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. CoRR abs/1601.06312 (2016) - 2015
- [j32]Rallis Karamichalis, Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
An investigation into inter- and intragenomic variations of graphic genomic signatures. BMC Bioinform. 16: 246:1-246:22 (2015) - [j31]Stavros Konstantinidis:
Implementation and Application of Automata (CIAA 2013). Theor. Comput. Sci. 578: 1 (2015) - [c18]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. DCFS 2015: 141-152 - [i4]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems. CoRR abs/1503.00035 (2015) - [i3]Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis:
Symbolic Manipulation of Code Properties. CoRR abs/1504.04715 (2015) - [i2]Stavros Konstantinidis, Mitja Mastnak:
Embedding rationally independent languages into maximal ones. CoRR abs/1507.00600 (2015) - 2014
- [j30]Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
On the maximality of languages with combined types of code properties. Theor. Comput. Sci. 550: 79-89 (2014) - [i1]Lila Kari, Stavros Konstantinidis, Steffen Kopecki, Meng Yang:
An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR abs/1406.1041 (2014) - 2013
- [j29]Stavros Konstantinidis, Nicolae Santean:
Computing maximal Kleene closures that are embeddable in a given subword-closed language. Nat. Comput. 12(2): 211-222 (2013) - [c17]Stavros Konstantinidis, Joshua Young:
Deciding the Density Type of a Given Regular Language. Stringology 2013: 21-33 - [e1]Stavros Konstantinidis:
Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings. Lecture Notes in Computer Science 7982, Springer 2013, ISBN 978-3-642-39273-3 [contents] - 2012
- [j28]Krystian Dudzinski, Stavros Konstantinidis:
Formal Descriptions of Code Properties: Decidability, Complexity, Implementation. Int. J. Found. Comput. Sci. 23(1): 67-85 (2012) - 2011
- [c16]Stavros Konstantinidis, Nicolae Santean:
Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language. DNA 2011: 115-129 - 2010
- [j27]Stavros Konstantinidis, Pedro V. Silva:
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages. Fundam. Informaticae 101(4): 257-270 (2010) - [j26]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
On implementing recognizable transductions. Int. J. Comput. Math. 87(2): 260-277 (2010) - [j25]Stavros Konstantinidis, Joshua Young:
f-Words and Binary Solid Codes. J. Autom. Lang. Comb. 15(3/4): 269-283 (2010)
2000 – 2009
- 2009
- [j24]Stavros Konstantinidis, Nicolae Santean:
On the definition of stochastic lambda-transducers. Int. J. Comput. Math. 86(8): 1300-1310 (2009) - [j23]Janusz A. Brzozowski, Stavros Konstantinidis:
State-complexity hierarchies of uniform languages of alphabet-size length. Theor. Comput. Sci. 410(35): 3223-3235 (2009) - 2008
- [j22]Cezar Câmpeanu, Stavros Konstantinidis:
State Complexity of the Subword Closure Operation with Applications to DNA Coding. Int. J. Found. Comput. Sci. 19(5): 1099-1112 (2008) - [j21]Stavros Konstantinidis, Pedro V. Silva:
Maximal Error-Detecting Capabilities of Formal Languages. J. Autom. Lang. Comb. 13(1): 55-71 (2008) - [c15]Janusz A. Brzozowski, Stavros Konstantinidis:
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length. DCFS 2008: 97-108 - 2007
- [j20]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
Representation and uniformization of algebraic transductions. Acta Informatica 43(6): 395-417 (2007) - [j19]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
Fuzzification of Rational and Recognizable Sets. Fundam. Informaticae 76(4): 413-447 (2007) - [j18]Stavros Konstantinidis:
Computing the edit distance of a regular language. Inf. Comput. 205(9): 1307-1316 (2007) - [c14]Bo Cui, Stavros Konstantinidis:
DNA Coding Using the Subword Closure Operation. DNA 2007: 284-289 - 2006
- [j17]Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
A Formal Language Analysis of DNA Hairpin Structures. Fundam. Informaticae 71(4): 453-475 (2006) - [j16]Helmut Jürgensen, Stavros Konstantinidis:
(Near-)inverses of sequences. Int. J. Comput. Math. 83(2): 203-222 (2006) - 2005
- [j15]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Operations on trajectories with applications to coding and bioinformatics. Int. J. Found. Comput. Sci. 16(3): 531-546 (2005) - [j14]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005) - [j13]Lila Kari, Stavros Konstantinidis:
Language equations, maximality and error-detection. J. Comput. Syst. Sci. 70(1): 157-178 (2005) - [j12]Lila Kari, Stavros Konstantinidis, Petr Sosík:
On properties of bond-free DNA languages. Theor. Comput. Sci. 334(1-3): 131-159 (2005) - [c13]Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307 - [c12]Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin:
Hairpin Structures in DNA Words. DNA 2005: 158-170 - [c11]Stavros Konstantinidis:
Computing the Levenshtein distance of a regular language. ITW 2005: 113-116 - 2004
- [j11]Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam:
Asymptotically Optimal Low-Cost Solid Codes. J. Autom. Lang. Comb. 9(1): 81-102 (2004) - [j10]Lila Kari, Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems. J. Autom. Lang. Comb. 9(2/3): 293-309 (2004) - [c10]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Substitution on Trajectories. Theory Is Forever 2004: 145-158 - [c9]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA 2004: 169-181 - [c8]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Preventing Undesirable Bonds Between DNA Codewords. DNA 2004: 182-191 - [c7]Lila Kari, Stavros Konstantinidis, Petr Sosík:
Substitutions, Trajectories and Noisy Channels. CIAA 2004: 202-212 - 2003
- [j9]Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak:
Sticky-free and overhang-free DNA languages. Acta Informatica 40(2): 119-157 (2003) - [j8]Salah Hussini, Lila Kari, Stavros Konstantinidis:
Coding properties of DNA languages. Theor. Comput. Sci. 290(3): 1557-1579 (2003) - [j7]Stavros Konstantinidis, Steven Perron, L. Amber Wilcox-O'Hearn:
On a simple method for detecting synchronization errors in coded messages. IEEE Trans. Inf. Theory 49(5): 1355-1363 (2003) - 2002
- [j6]Stavros Konstantinidis:
Error-Correction, and Finite-Delay Decodability. J. Univers. Comput. Sci. 8(2): 278-291 (2002) - [j5]Stavros Konstantinidis, Amber O'Hearn:
Error-detecting properties of languages. Theor. Comput. Sci. 276(1-2): 355-375 (2002) - [c6]Lila Kari, Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems. DCFS 2002: 133-147 - 2001
- [j4]Stavros Konstantinidis:
An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types. Inf. Comput. 167(2): 120-131 (2001) - [j3]Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis:
Maximal Solid Codes. J. Autom. Lang. Comb. 6(1): 25-50 (2001) - [j2]Stavros Konstantinidis:
Relationships between different error-correcting capabilities of a code. IEEE Trans. Inf. Theory 47(5): 2065-2069 (2001) - [c5]Salah Hussini, Lila Kari, Stavros Konstantinidis:
Coding Properties of DNA Languages. DNA 2001: 57-69 - 2000
- [c4]Stavros Konstantinidis:
Error-Detecting Properties of Languages. Words, Languages & Combinatorics 2000: 240-252
1990 – 1999
- 1999
- [j1]Stavros Konstantinidis:
Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types. IEEE Trans. Inf. Theory 45(1): 60-77 (1999) - 1997
- [p1]Helmut Jürgensen, Stavros Konstantinidis:
Codes1. Handbook of Formal Languages (1) 1997: 511-607 - 1995
- [c3]Helmut Jürgensen, Stavros Konstantinidis:
Variable-Length Codes for Error Correction. ICALP 1995: 581-592 - [c2]Helmut Jürgensen, Stavros Konstantinidis:
Error Corrections for Channels with Substitutions, Insertions, and Deletions. Information Theory and Applications 1995: 149-163 - 1993
- [c1]Helmut Jürgensen, Stavros Konstantinidis:
The Hierarchy of Codes. FCT 1993: 50-68
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
