Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Minimization algorithms for sequential transducers
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Codes
A Fast Algorithm to Decide on Simple Grammars Equivalence
Proceedings of the International Symposium on Optimal Algorithms
A characterization of s-languages
Information Processing Letters
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Prime decompositions of regular prefix codes
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Prime normal form and equivalence of simple grammars
Theoretical Computer Science - Implementation and application of automata
Equivalence of simple functions
Theoretical Computer Science
Computing the throughput of Concatenation State Machines
Journal of Discrete Algorithms
Reducing simple grammars: exponential against highly-polynomial time in practice
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Equivalence of functions represented by simple context-free grammars with output
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We introduce a class of deterministic push-down transducers called concatenation state machines (CSM), and we study its semantic domain which is a class of partial mappings over finitely generated free monoids, called simple functions.