Concatenation state machines and simple functions

Lecture Notes in Computer Science

Volumn 3317, Issue , 2005, Pages 113-124

  Debski, Wojciech ^a   Praczak, Wojciech ^a,b  

^a IDT Canada   (Canada)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MAPPING; SEMANTICS;

CONCATENATION STATE MACHINES (CSM); FREE MONOIDS; PARTIAL MAPPINGS;

LEARNING SYSTEMS;

EID: 23944436371     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30500-2_11     Document Type: Conference Paper

References (10)

1. Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proc. IEEE 7th Annual Symposium on Switching and Automata Theory. IEEE Symposium on Foundations of Computer Science (1966) 36-46
2. Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In Salomaa, A., Rozenberg, G., eds.: Handbook of Formal Languages. Volume 1, Word Language Grammar. Springer-Verlag, Berlin (1997) 111-174
3. Fraczak, W., Podolak, A.: A characterization of s-languages. Information Processing Letters 89 (2004) 65-70
4. Berstel, J., Perrin, D.: Theory of Codes. Academic Press (1985)
5. Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science 234 (2000) 177-201
6. Caucal, D.: A fast algorithm to decide on simple grammars equivalence. In: Optimal Algorithms. Volume 401 of LNCS. Springer (1989)
7. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Prime decompositions of regular prefix codes. In: Implementation and Application of Automata, CIAA 2002. Volume 2608 of LNCS. Springer, Tours, France (2003) 85-94
8. Tarjan, R.: Finding dominators in directed graphs. SIAM Journal on Computing 3 (1974) 62-89
9. Eilenberg, S.: Automata, Languages, and Machines. Volume A. Academic Press (1974)
10. Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)