The following pages link to Laura Giambruno (Q450550):
Displayed 13 items.
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- Transducers for the bidirectional decoding of prefix codes (Q964396) (← links)
- On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
- ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS (Q2909196) (← links)
- Representing prefix and border tables: results on enumeration (Q2971066) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid (Q3526414) (← links)
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005) (← links)
- Complexity of Operations on Cofinite Languages (Q3557023) (← links)
- THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES (Q3586401) (← links)
- On the Number of Prefix and Border Tables (Q5405063) (← links)
- A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay (Q5894977) (← links)
- A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay (Q5899549) (← links)