default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSzabolcs Iván
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[e2]Zsolt Gazdag, Szabolcs Iván, Gergely Kovásznai:
Proceedings of the 16th International Conference on Automata and Formal Languages, AFL 2023, Eger, Hungary, September 5-7, 2023. EPTCS 386, 2023 [contents]- 2022
- [j16]Kitti Gelle, Szabolcs Iván:
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata. Int. J. Found. Comput. Sci. 33(3&4): 247-262 (2022) - 2021
- [j15]Zsolt Gazdag
, Károly Hajagos, Szabolcs Iván:
On the power of P systems with active membranes using weak non-elementary membrane division. J. Membr. Comput. 3(4): 258-269 (2021) - 2020
- [c16]Kitti Gelle, Szabolcs Iván:
The Order Type of Scattered Context-Free Orderings of Rank One Is Computable. SOFSEM 2020: 273-284 - [i16]Kitti Gelle, Szabolcs Iván:
Scattered one-counter languges have rank less than ω2. CoRR abs/2007.00090 (2020) - [i15]Zsolt Gazdag, Károly Hajagos, Szabolcs Iván:
On the number of useful objects in P systems with active membranes. CoRR abs/2008.04993 (2020)
2010 – 2019
- 2019
- [j14]Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. Int. J. Found. Comput. Sci. 30(6-7): 1029-1045 (2019) - [j13]Kitti Gelle, Szabolcs Iván:
The ordinal generated by an ordinal grammar is computable. Theor. Comput. Sci. 793: 1-13 (2019) - [c15]Kitti Gelle, Szabolcs Iván:
The Syntactic Complexity of Semi-flower Languages. DCFS 2019: 147-157 - [c14]Kitti Gelle, Szabolcs Iván:
On the Order Type of Scattered Context-Free Orderings. GandALF 2019: 169-182 - [i14]Kitti Gelle, Szabolcs Iván:
The order type of scattered context-free orderings of rank one is computable. CoRR abs/1907.11573 (2019) - 2018
- [j12]Kitti Gelle, Szabolcs Iván:
DFS is Unsparsable and Lookahead Can Help in Maximal Matching. Acta Cybern. 23(3): 887-902 (2018) - [j11]Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find trees is NP-complete. Inf. Process. Lett. 131: 7-14 (2018) - [i13]Kitti Gelle, Szabolcs Iván:
Maintaning maximal matching with lookahead. CoRR abs/1807.05009 (2018) - [i12]Kitti Gelle, Szabolcs Iván:
The ordinal generated by an ordinal grammar is computable. CoRR abs/1811.03595 (2018) - 2017
- [j10]Kitti Gelle, Szabolcs Iván:
Regular Expressions for Muller Context-Free Languages. Acta Cybern. 23(1): 349-369 (2017) - [c13]Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. DCFS 2017: 152-163 - [c12]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional Coverings, Greedy Coverings, and Rectifier Networks. STACS 2017: 23:1-23:14 - [c11]Kitti Gelle, Szabolcs Iván:
Reversible languages having finitely many reduced automata. AFL 2017: 114-127 - [i11]Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete. CoRR abs/1704.07254 (2017) - 2016
- [j9]Szabolcs Iván, Judit Nagy-György:
On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity. Acta Cybern. 22(3): 687-701 (2016) - [j8]Szabolcs Iván:
Complexity of atoms, combinatorially. Inf. Process. Lett. 116(5): 356-360 (2016) - [c10]Zoltán Ésik, Szabolcs Iván:
MSO-definable Properties of Muller Context-Free Languages Are Decidable. DCFS 2016: 87-97 - 2015
- [j7]Norbert Hantos, Szabolcs Iván, Péter Balázs, Kálmán Palágyi:
Binary image reconstruction from a small number of projections and the morphological skeleton. Ann. Math. Artif. Intell. 75(1-2): 195-216 (2015) - [i10]Szabolcs Iván:
Algebraic characterization of temporal logics on forests. CoRR abs/1506.03843 (2015) - [i9]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional coverings, greedy coverings, and rectifier networks. CoRR abs/1509.07588 (2015) - [i8]Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find trees is NP-complete. CoRR abs/1510.07462 (2015) - 2014
- [j6]Zoltán Ésik, Szabolcs Iván:
Operational Characterization of Scattered MCFLs. Int. J. Found. Comput. Sci. 25(8): 1001-1016 (2014) - [c9]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS 2014: 174-185 - [c8]Szabolcs Iván:
Synchronizing weighted automata. AFL 2014: 301-313 - [i7]Szabolcs Iván, Judit Nagy-György:
On nonpermutational transformation semigroups with an application to syntactic complexity. CoRR abs/1402.7289 (2014) - [i6]Szabolcs Iván:
Handle Atoms with Care. CoRR abs/1404.6632 (2014) - [i5]Szabolcs Iván:
On state complexity of unions of binary factor-free languages. CoRR abs/1405.1107 (2014) - [i4]Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán:
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR abs/1406.0017 (2014) - 2013
- [c7]Zoltán Ésik, Szabolcs Iván:
Operational Characterization of Scattered MCFLs. Developments in Language Theory 2013: 215-226 - [i3]Szabolcs Iván, Judit Nagy-György:
On the structure and syntactic complexity of generalized definite languages. CoRR abs/1304.5714 (2013) - [i2]Zoltán Ésik, Szabolcs Iván:
Operational characterization of scattered MCFLs -- Technical Report. CoRR abs/1304.6388 (2013) - 2012
- [j5]Zoltán Ésik, Szabolcs Iván:
On Müller context-free grammars. Theor. Comput. Sci. 416: 17-32 (2012) - [c6]Zoltán Ésik, Szabolcs Iván:
Hausdorff Rank of Scattered Context-Free Linear Orders. LATIN 2012: 291-302 - 2011
- [j4]Zoltán Ésik, Szabolcs Iván:
Büchi context-free languages. Theor. Comput. Sci. 412(8-10): 805-821 (2011) - [c5]Szabolcs Iván, Ágnes Mészáros:
Müller context-free grammars generating well-ordered words. AFL 2011: 225-240 - [e1]Pál Dömösi, Szabolcs Iván:
Automata and Formal Languages, 13th International Conference, AFL 2011, Debrecen, Hungary, August 17-22, 2011, Proceedings. 2011, ISBN 978-615-5097-19-5 [contents] - [i1]Zoltán Ésik, Szabolcs Iván:
Context-free ordinals. CoRR abs/1103.5421 (2011) - 2010
- [c4]Zoltán Ésik, Szabolcs Iván:
On Müller Context-Free Grammars. Developments in Language Theory 2010: 173-184
2000 – 2009
- 2009
- [j3]Zsolt Gazdag, Szabolcs Iván, Judit Nagy-György:
Improved upper bounds on synchronizing nondeterministic automata. Inf. Process. Lett. 109(17): 986-990 (2009) - [c3]Zoltán Ésik, Szabolcs Iván:
Context-Free Languages of Countable Words. ICTAC 2009: 185-199 - 2008
- [j2]Zoltán Ésik, Szabolcs Iván:
Products of Tree Automata with an Application to Temporal Logic. Fundam. Informaticae 82(1-2): 61-78 (2008) - [j1]Zoltán Ésik, Szabolcs Iván:
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. Fundam. Informaticae 82(1-2): 79-103 (2008) - [c2]Zoltán Ésik, Szabolcs Iván:
Games for Temporal Logics on Trees. CIAA 2008: 191-200 - 2007
- [c1]Zoltán Ésik, Szabolcs Iván:
Aperiodicity in Tree Automata. CAI 2007: 189-207
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-04-25 05: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
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:
