Szabolcs Iván

Int. J. Found. Comput. Sci., 2022

2021

On the power of P systems with active membranes using weak non-elementary membrane division.

[BibT_eX]

[DOI]

Zsolt Gazdag

Károly Hajagos

J. Membr. Comput., 2021

2020

On the number of useful objects in P systems with active membranes.

[BibT_eX]

[DOI]

Zsolt Gazdag

Károly Hajagos

CoRR, 2020

Scattered one-counter languges have rank less than ω<sup>2</sup>.

[BibT_eX]

[DOI]

CoRR, 2020

The Order Type of Scattered Context-Free Orderings of Rank One Is Computable.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

The ordinal generated by an ordinal grammar is computable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

On the Order Type of Scattered Context-Free Orderings.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

The Syntactic Complexity of Semi-flower Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Recognizing Union-Find trees is NP-complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Maintaning maximal matching with lookahead.

[BibT_eX]

[DOI]

CoRR, 2018

DFS is Unsparsable and Lookahead Can Help in Maximal Matching.

[BibT_eX]

[DOI]

Acta Cybern., 2018

2017

Reversible languages having finitely many reduced automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Regular Expressions for Muller Context-Free Languages.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Fractional Coverings, Greedy Coverings, and Rectifier Networks.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

Complexity of atoms, combinatorially.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity.

[BibT_eX]

[DOI]

Judit Nagy-György

Acta Cybern., 2016

MSO-definable Properties of Muller Context-Free Languages Are Decidable.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

Algebraic characterization of temporal logics on forests.

[BibT_eX]

[DOI]

CoRR, 2015

Binary image reconstruction from a small number of projections and the morphological skeleton.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2015

2014

Operational Characterization of Scattered MCFLs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal.

[BibT_eX]

[DOI]

CoRR, 2014

On state complexity of unions of binary factor-free languages.

[BibT_eX]

[DOI]

CoRR, 2014

Handle Atoms with Care.

[BibT_eX]

[DOI]

CoRR, 2014

Synchronizing weighted automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Biclique Coverings, Rectifier Networks and the Cost of ε-Removal.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

Operational characterization of scattered MCFLs -- Technical Report

[BibT_eX]

[DOI]

CoRR, 2013

On the structure and syntactic complexity of generalized definite languages

[BibT_eX]

[DOI]

Judit Nagy-György

CoRR, 2013

2012

On Müller context-free grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Hausdorff Rank of Scattered Context-Free Linear Orders.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Büchi context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Context-free ordinals

[BibT_eX]

[DOI]

CoRR, 2011

Müller context-free grammars generating well-ordered words.

[BibT_eX]

Ágnes Mészáros

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2009

Improved upper bounds on synchronizing nondeterministic automata.

[BibT_eX]

[DOI]

Zsolt Gazdag

Judit Nagy-György

Inf. Process. Lett., 2009

Context-Free Languages of Countable Words.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2009

2008

Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Products of Tree Automata with an Application to Temporal Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Games for Temporal Logics on Trees.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Applications of Automata, 2008

2007

Aperiodicity in Tree Automata.

[BibT_eX]

[DOI]