The following pages link to Pierluigi San Pietro (Q235674):
Displaying 20 items.
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- (Q685608) (redirect page) (← links)
- Embedding time granularity in a logical specification language for synchronous real-time systems (Q685609) (← links)
- Reducing local alphabet size in recognizable picture languages (Q832926) (← links)
- Tree adjoining languages and multipushdown languages (Q1587367) (← links)
- Deque languages, automata and planar graphs (Q1622967) (← links)
- A polynomial-time parsing algorithm for \(K\)-depth languages (Q1915505) (← links)
- Regular languages as local functions with small alphabets (Q2175415) (← 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)
- 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)
- (Q2770668) (← 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)
- Consensual languages and matching finite-state computations (Q3006160) (← links)
