![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Alexandros Palioudakis
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j9]Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa:
Growth Rate of Minimum Branching. J. Autom. Lang. Comb. 23(1-3): 281-292 (2018) - 2017
- [j8]Alexandros Palioudakis
, Kai Salomaa, Selim G. Akl:
Worst Case Branching and Other Measures of Nondeterminism. Int. J. Found. Comput. Sci. 28(3): 195-210 (2017) - [j7]Da-Jung Cho, Daniel Goc
, Yo-Sub Han, Sang-Ki Ko
, Alexandros Palioudakis
, Kai Salomaa:
State complexity of permutation on finite languages over a binary alphabet. Theor. Comput. Sci. 682: 67-78 (2017) - 2016
- [j6]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. Int. J. Unconv. Comput. 12(2-3): 145-167 (2016) - [j5]Alexandros Palioudakis
, Kai Salomaa, Selim G. Akl:
Operational state complexity of unary NFAs with finite nondeterminism. Theor. Comput. Sci. 610: 108-120 (2016) - 2015
- [j4]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form. Int. J. Unconv. Comput. 11(5-6): 395-416 (2015) - [c8]Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko
, Kai Salomaa:
The State Complexity of Permutations on Finite Languages over Binary Alphabets. DCFS 2015: 220-230 - [c7]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. UCNC 2015: 157-168 - 2014
- [b1]Alexandros Palioudakis:
State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism. Queen's University at Kingston, Ontario, Canada, 2014 - [j3]Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. Int. J. Found. Comput. Sci. 25(7): 823-836 (2014) - [j2]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. J. Autom. Lang. Comb. 19(1-4): 251-264 (2014) - [c6]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism. DCFS 2014: 330-341 - [c5]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs with Limited Nondeterminism. SOFSEM 2014: 443-454 - 2013
- [c4]Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. DCFS 2013: 102-111 - [c3]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Comparisons between Measures of Nondeterminism on Finite Automata. DCFS 2013: 217-228 - [c2]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Finite Nondeterminism vs. DFAs with Multiple Initial States. DCFS 2013: 229-240 - 2012
- [j1]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Finite Tree Width NFAs. J. Autom. Lang. Comb. 17(2-4): 245-264 (2012) - [c1]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity and Limited Nondeterminism. DCFS 2012: 252-265
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint