Luca Prigioniero

Javad Taheri

CoRR, July, 2025

Kernels of Context-Free Languages.

[BibT_eX]

[DOI]

Martin Kutrib

Alessandro Clerici Lorenzini

Int. J. Found. Comput. Sci., 2025

Two-Way Automata and Bounded Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2025

Nondeterminism Makes Unary 1-Limited Automata Concise.

[BibT_eX]

[DOI]

Javad Taheri

Proceedings of the Developments in Language Theory - 29th International Conference, 2025

2024

Operational State Complexity of Block Languages.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

On the Representation of Block Languages.

[BibT_eX]

[DOI]

CoRR, 2024

Block Languages and Their Bitmap Representations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2024

2023

Weight-reducing Turing machines.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Once-Marking and Always-Marking 1-Limited Automata.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Forgetting 1-Limited Automata.

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

Two-Way Machines and de Bruijn Words.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2023

Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2023

Magic Numbers in Periodic Sequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

1-Limited Automata: Witness Languages and Techniques.

[BibT_eX]

[DOI]

Simon Sádovský

J. Autom. Lang. Comb., 2022

Weakly and Strongly Irreversible Regular Languages.

[BibT_eX]

[DOI]

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

Converting nondeterministic two-way automata into small deterministic linear-time machines.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Performing Regular Operations with 1-Limited Automata.

[BibT_eX]

[DOI]

Simon Sádovský

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Boolean Kernels of Context-Free Languages.

[BibT_eX]

[DOI]

Martin Kutrib

Proceedings of the Implementation and Application of Automata, 2021

Regular Languages: To Finite Automata and Beyond (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, 2021

2020

Foundations of Reversible Computation.

[BibT_eX]

[DOI]

Claudio Antares Mezzina

Proceedings of the Reversible Computation: Extending Horizons of Computing, 2020

Regular languages: to finite automata and beyond - succinct descriptions and optimal simulations.

[BibT_eX]

[DOI]

PhD thesis, 2020

Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Space Complexity of Stack Automata Models.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Pushdown Automata and Constant Height: Decidability and Bounds.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Reversible Pushdown Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Linear-Time Limited Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

Weakly and Strongly Irreversible Regular Languages.

[BibT_eX]

[DOI]

Giovanna J. Lavado

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

Non-self-embedding grammars and descriptional complexity.

[BibT_eX]

Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

Limited Automata and Unary Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Concise Representations of Reversible Automata.

[BibT_eX]

[DOI]

Giovanna J. Lavado

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

Minimal and Reduced Reversible Automata.

[BibT_eX]

[DOI]

Giovanna J. Lavado