Stefano Crespi Reghizzi

From MaRDI portal
Person:235673

Available identifiers

zbMath Open crespi-reghizzi.stefanoMaRDI QIDQ235673

List of research outcomes





PublicationDate of PublicationType
Regular languages as images of local functions over small alphabets2024-12-03Paper
From words to pictures: row-column combinations and Chomsky-Schützenberger theorem2024-06-03Paper
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages2024-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 codes2022-09-27Paper
Reducing local alphabet size in recognizable picture languages2022-03-25Paper
Two-dimensional models2022-02-04Paper
https://portal.mardi4nfdi.de/entity/Q50163612021-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 expressions2021-06-23Paper
https://portal.mardi4nfdi.de/entity/Q49949462021-06-22Paper
Deque automata, languages, and planar graph representations2020-08-17Paper
Beyond operator-precedence grammars and languages2020-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 alphabet2019-12-18Paper
Deque languages, automata and planar graphs2018-11-22Paper
Fast deterministic parsers for transition networks2018-10-09Paper
Counter machines, Petri nets, and consensual computation2017-03-16Paper
Toward a theory of input-driven locally parsable languages2016-12-19Paper
The Missing Case in Chomsky-Schützenberger Theorem2016-04-13Paper
From regular to strictly locally testable languages2016-03-01Paper
BSP: A Parsing Tool for Ambiguous Regular Expressions2015-09-23Paper
From Ambiguous Regular Expressions to Deterministic Parsing Automata2015-09-23Paper
Locally Chain-Parsable Languages2015-09-16Paper
Complexity of Extended vs. Classic LR Parsers2014-08-07Paper
Shift-Reduce Parsers for Transition Networks2014-03-31Paper
STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES2014-03-10Paper
Formal languages and compilation2013-12-05Paper
Deterministic Counter Machines and Parallel Matching Computations2013-08-07Paper
From regular to strictly locally testable languages2013-07-30Paper
Operator precedence and the visibly pushdown property2012-11-06Paper
Strict Local Testability with Consensus Equals Regularity2012-09-20Paper
A unifying approach to picture grammars2011-10-10Paper
Consensual languages and matching finite-state computations2011-06-10Paper
Efficient recognition of trace languages defined by repeat-until loops2010-08-19Paper
Deterministic parsing for augmented context-free grammars2010-06-17Paper
Operator Precedence and the Visibly Pushdown Property2010-05-26Paper
A CKY parser for picture grammars2010-03-24Paper
Traces of Control-Flow Graphs2009-07-07Paper
Regional Languages and Tiling: A Unifying Approach to Picture Grammars2009-02-03Paper
Formal languages and compilation2009-01-15Paper
Consensual Definition of Languages by Regular Sets2008-11-20Paper
A SAT-based parser and completer for pictures specified by tiling2007-11-07Paper
Picture languages: tiling systems versus tile rewriting grammars.2006-05-18Paper
Tile rewriting grammars and picture languages2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q47386872004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44531922004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44483642004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44520632004-02-11Paper
Associative language descriptions2002-03-03Paper
Associative definition of programming languages2001-11-08Paper
Grammar partitioning and modular deterministic parsing2000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q45039532000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q42665451999-10-03Paper
MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS1997-01-22Paper
QRT FIFO automata, breadth-first grammars and their relations1992-06-28Paper
BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37982721988-01-01Paper
On Deterministic Multi-Pass Analysis1986-01-01Paper
Operator Precedence Grammars and the Noncounting Property1981-01-01Paper
La teoria della complessita’ del calcolo: Un nuovo capitolo dell’algoritmica1981-01-01Paper
Algebraic properties of operator precedence languages1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41536151976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56842471973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56680121972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56070151970-01-01Paper

Research outcomes over time

This page was built for person: Stefano Crespi Reghizzi