Stefano Crespi Reghizzi

From MaRDI portal
(Redirected from Person:235673)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Multi-entry DFA with reduced initial states to speedup parallel recognition2026-02-10Paper
Homomorphic definitions of tree languages via comma-free tree codes
Journal of Automata, Languages and Combinatorics
2025-11-25Paper
Row-column combination of Dyck words
Acta Informatica
2025-06-02Paper
Regular languages as images of local functions over small alphabets
Information and Computation
2024-12-03Paper
From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
Theoretical Computer Science
2024-06-03Paper
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
Logical Methods in Computer Science
2024-01-16Paper
The alphabetic complexity in homomorphic definitions of word, tree and picture languages2023-01-18Paper
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Theoretical Computer Science
2022-09-27Paper
Reducing local alphabet size in recognizable picture languages2022-03-25Paper
Two-dimensional models2022-02-04Paper
Higher-order operator precedence languages2021-12-13Paper
Higher-order operator precedence languages
(available as arXiv preprint)
2021-12-13Paper
Homomorphic characterization of tree languages based on comma-free encoding2021-10-04Paper
Star-freeness, first-order definability and aperiodicity of structured context-free languages2021-07-08Paper
A deterministic parsing algorithm for ambiguous regular expressions
Acta Informatica
2021-06-23Paper
Commutative languages and their composition by consensual methods2021-06-22Paper
Commutative languages and their composition by consensual methods
(available as arXiv preprint)
2021-06-22Paper
Deque automata, languages, and planar graph representations
Theoretical Computer Science
2020-08-17Paper
Beyond operator-precedence grammars and languages
Journal of Computer and System Sciences
2020-06-09Paper
A benchmark production tool for regular expressions2020-05-06Paper
Regular languages as local functions with small alphabets2020-04-29Paper
Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
Information and Computation
2019-12-18Paper
Deque languages, automata and planar graphs2018-11-22Paper
Deque languages, automata and planar graphs
(available as arXiv preprint)
2018-11-22Paper
Fast deterministic parsers for transition networks
Acta Informatica
2018-10-09Paper
Counter machines, Petri nets, and consensual computation
Theoretical Computer Science
2017-03-16Paper
Toward a theory of input-driven locally parsable languages
Theoretical Computer Science
2016-12-19Paper
The missing case in Chomsky-Schützenberger theorem
Language and Automata Theory and Applications
2016-04-13Paper
From regular to strictly locally testable languages
Electronic Proceedings in Theoretical Computer Science
2016-03-01Paper
From regular to strictly locally testable languages
Electronic Proceedings in Theoretical Computer Science
2016-03-01Paper
\textit{BSP}: a parsing tool for ambiguous regular expressions
Implementation and Application of Automata
2015-09-23Paper
From ambiguous regular expressions to deterministic parsing automata
Implementation and Application of Automata
2015-09-23Paper
Locally chain-parsable languages
Mathematical Foundations of Computer Science 2015
2015-09-16Paper
Complexity of extended vs. classic LR parsers
Descriptional Complexity of Formal Systems
2014-08-07Paper
Shift-reduce parsers for transition networks
Language and Automata Theory and Applications
2014-03-31Paper
Strict local testability with consensus equals regularity, and other properties
International Journal of Foundations of Computer Science
2014-03-10Paper
Formal languages and compilation
Texts in Computer Science
2013-12-05Paper
Deterministic counter machines and parallel matching computations
Implementation and Application of Automata
2013-08-07Paper
From regular to strictly locally testable languages
International Journal of Foundations of Computer Science
2013-07-30Paper
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
2012-11-06Paper
Strict local testability with consensus equals regularity
Implementation and Application of Automata
2012-09-20Paper
A unifying approach to picture grammars
Information and Computation
2011-10-10Paper
Consensual languages and matching finite-state computations
RAIRO - Theoretical Informatics and Applications
2011-06-10Paper
Consensual languages and matching finite-state computations
RAIRO - Theoretical Informatics and Applications
2011-06-10Paper
Efficient recognition of trace languages defined by repeat-until loops
Information and Computation
2010-08-19Paper
Deterministic parsing for augmented context-free grammars
Lecture Notes in Computer Science
2010-06-17Paper
Operator precedence and the visibly pushdown property
Language and Automata Theory and Applications
2010-05-26Paper
A CKY parser for picture grammars
Information Processing Letters
2010-03-24Paper
Traces of Control-Flow Graphs
Developments in Language Theory
2009-07-07Paper
Regional Languages and Tiling: A Unifying Approach to Picture Grammars
Lecture Notes in Computer Science
2009-02-03Paper
Formal languages and compilation
Texts in Computer Science
2009-01-15Paper
Consensual Definition of Languages by Regular Sets
Language and Automata Theory and Applications
2008-11-20Paper
A SAT-based parser and completer for pictures specified by tiling
Pattern Recognition
2007-11-07Paper
Picture languages: tiling systems versus tile rewriting grammars.
Theoretical Computer Science
2006-05-18Paper
Tile rewriting grammars and picture languages
Theoretical Computer Science
2005-08-01Paper
scientific article; zbMATH DE number 2087752 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2050918 (Why is no real title available?)2004-03-07Paper
scientific article; zbMATH DE number 2044500 (Why is no real title available?)2004-02-18Paper
scientific article; zbMATH DE number 2040907 (Why is no real title available?)2004-02-11Paper
Associative language descriptions
Theoretical Computer Science
2002-03-03Paper
Associative definition of programming languages
Computer Languages
2001-11-08Paper
Grammar partitioning and modular deterministic parsing
Computer Languages
2000-11-22Paper
scientific article; zbMATH DE number 1507233 (Why is no real title available?)2000-09-14Paper
scientific article; zbMATH DE number 1346521 (Why is no real title available?)1999-10-03Paper
MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
International Journal of Foundations of Computer Science
1997-01-22Paper
QRT FIFO automata, breadth-first grammars and their relations
Theoretical Computer Science
1992-06-28Paper
BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA
International Journal of Foundations of Computer Science
1990-01-01Paper
scientific article; zbMATH DE number 4064525 (Why is no real title available?)1988-01-01Paper
On Deterministic Multi-Pass Analysis
SIAM Journal on Computing
1986-01-01Paper
Operator Precedence Grammars and the Noncounting Property
SIAM Journal on Computing
1981-01-01Paper
La teoria della complessita’ del calcolo: Un nuovo capitolo dell’algoritmica
Rendiconti del Seminario Matematico e Fisico di Milano
1981-01-01Paper
Algebraic properties of operator precedence languages
Information and Control
1978-01-01Paper
scientific article; zbMATH DE number 3586501 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3421925 (Why is no real title available?)1973-01-01Paper
scientific article; zbMATH DE number 3402109 (Why is no real title available?)1972-01-01Paper
scientific article; zbMATH DE number 3328754 (Why is no real title available?)1970-01-01Paper


Research outcomes over time


This page was built for person: Stefano Crespi Reghizzi