The following pages link to Stefano Crespi Reghizzi (Q235673):
Displayed 50 items.
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- A unifying approach to picture grammars (Q719247) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← links)
- Reducing local alphabet size in recognizable picture languages (Q832926) (← links)
- Efficient recognition of trace languages defined by repeat-until loops (Q989291) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- Deque languages, automata and planar graphs (Q1622967) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Fast deterministic parsers for transition networks (Q1789065) (← links)
- A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
- Star-freeness, first-order definability and aperiodicity of structured context-free languages (Q2037942) (← links)
- Two-dimensional models (Q2074211) (← links)
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages (Q2112173) (← links)
- Regular languages as local functions with small alphabets (Q2175415) (← links)
- A benchmark production tool for regular expressions (Q2177602) (← links)
- Beyond operator-precedence grammars and languages (Q2186819) (← links)
- Deque automata, languages, and planar graph representations (Q2192371) (← links)
- Homomorphic characterization of tree languages based on comma-free encoding (Q2232286) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- A CKY parser for picture grammars (Q2380077) (← links)
- A SAT-based parser and completer for pictures specified by tiling (Q2459547) (← links)
- Tile rewriting grammars and picture languages (Q2484438) (← links)
- Picture languages: tiling systems versus tile rewriting grammars. (Q2490811) (← links)
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes (Q2676458) (← links)
- Associative definition of programming languages (Q2755402) (← links)
- From Regular to Strictly Locally Testable Languages (Q2789519) (← links)
- The Missing Case in Chomsky-Schützenberger Theorem (Q2798732) (← links)
- FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES (Q2841978) (← links)
- Strict Local Testability with Consensus Equals Regularity (Q2914699) (← links)
- Locally Chain-Parsable Languages (Q2946332) (← links)
- From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
- BSP: A Parsing Tool for Ambiguous Regular Expressions (Q2947431) (← links)
- Consensual languages and matching finite-state computations (Q3006160) (← links)
- BREADTH AND DEPTH GRAMMARS AND DEQUE AUTOMATA (Q3358243) (← links)
- Consensual Definition of Languages by Regular Sets (Q3540109) (← links)
- Operator Precedence and the Visibly Pushdown Property (Q3564862) (← links)
- Deterministic parsing for augmented context-free grammars (Q3569023) (← links)
- Regional Languages and Tiling: A Unifying Approach to Picture Grammars (Q3599132) (← links)
- Traces of Control-Flow Graphs (Q3637222) (← links)
- On Deterministic Multi-Pass Analysis (Q3751036) (← links)
- (Q3798272) (← links)
- Operator Precedence Grammars and the Noncounting Property (Q3902527) (← links)
- (Q4153615) (← links)
- Algebraic properties of operator precedence languages (Q4155847) (← links)
- (Q4266545) (← links)
- (Q4448364) (← links)
- (Q4452063) (← links)
- (Q4453192) (← links)
- (Q4503953) (← links)
- Grammar partitioning and modular deterministic parsing (Q4719301) (← links)