SCOPUS 정보 검색 플랫폼

Volumn 306, Issue 1-3, 2003, Pages 85-100

Regular closed sets of permutations

Author keywords

Involvement; Permutations; Regular sets

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; FINITE AUTOMATA;

PERMUTATIONS;

COMPUTER SCIENCE;

EID: 0041507104 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(03)00212-3 Document Type: Article

Times cited : (29)

References (12)

1
- 0003373725
- Restricted permutations
- Atkinson M.D. Restricted permutations. Discrete Math. 195:1998;27-38.
- (1998) Discrete Math. , vol.195 , pp. 27-38
- Atkinson, M.D.¹

2
- 0031144622
- Permutations generated by token passing in graphs
- Atkinson M.D., Livesey M.J., Tulley D.H. Permutations generated by token passing in graphs. Theoret. Comput. Sci. 178:1997;103-118.
- (1997) Theoret. Comput. Sci. , vol.178 , pp. 103-118
- Atkinson, M.D.¹ Livesey, M.J.² Tulley, D.H.³

3
- 0141465276
- Partially well-ordered closed sets of permutations
- Atkinson M.D., Murphy M.M., Ruškuc N. Partially well-ordered closed sets of permutations. J. Order. 19:2002;101-113.
- (2002) J. Order , vol.19 , pp. 101-113
- Atkinson, M.D.¹ Murphy, M.M.² Ruškuc, N.³

4
- 0002540288
- Permutations avoiding an increasing number of length increasing forbidden subsequences
- Barcucci E., Del Lungo A., Pergola E., Pinzani R. Permutations avoiding an increasing number of length increasing forbidden subsequences. Discrete Math. Theoret. Comput. Sci. 4:2000;31-44.
- (2000) Discrete Math. Theoret. Comput. Sci. , vol.4 , pp. 31-44
- Barcucci, E.¹ Del Lungo, A.² Pergola, E.³ Pinzani, R.⁴

5
- 0000150371
- Exact enumeration of 1342-avoiding permutations; a close link with labeled trees and planar maps
- Bóna M. Exact enumeration of 1342-avoiding permutations; a close link with labeled trees and planar maps. J. Combin. Theory Ser. A. 80:1997;257-272.
- (1997) J. Combin. Theory Ser. A , vol.80 , pp. 257-272
- Bóna, M.¹

6
- 0000073312
- Forbidden subsequences and Chebyshev polynomials
- Chow T., West J. Forbidden subsequences and Chebyshev polynomials. Discrete Math. 204:1999;119-128.
- (1999) Discrete Math. , vol.204 , pp. 119-128
- Chow, T.¹ West, J.²

7
- 0003620778
- Reading, MA: Addison-Wesley
- Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
- (1979) Introduction to Automata Theory, Languages, and Computation
- Hopcroft, J.E.¹ Ullman, J.D.²

8
- 0003657593
- 2nd Edition, Addison-Wesley, Reading, MA
- D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, Vol. 1, 2nd Edition, Addison-Wesley, Reading, MA, 1973.
- (1973) Fundamental Algorithms, the Art of Computer Programming , vol.1
- Knuth, D.E.¹

9
- 0037891640
- Restricted 132-avoiding permutations
- Mansour T., Vainshtein A. Restricted 132-avoiding permutations. Adv. in Appl. Math. 26:2001;258-269.
- (2001) Adv. in Appl. Math. , vol.26 , pp. 258-269
- Mansour, T.¹ Vainshtein, A.²

10
- 0015770335
- Computing permutations with double-ended queues, parallel stacks and parallel queues
- Pratt V.R. Computing permutations with double-ended queues, parallel stacks and parallel queues. Proc. ACM Symp. Theory Comput. 5:1973;268-277.
- (1973) Proc. ACM Symp. Theory Comput. , vol.5 , pp. 268-277
- Pratt, V.R.¹

11
- 84976820924
- Sorting using networks of queues and stacks
- Tarjan R.E. Sorting using networks of queues and stacks. J. Assoc. Comput. Mach. 19:1972;341-346.
- (1972) J. Assoc. Comput. Mach. , vol.19 , pp. 341-346
- Tarjan, R.E.¹

12
- 0000464149
- Generating trees and the Catalan and Schröder numbers
- West J. Generating trees and the Catalan and Schröder numbers. Discrete Math. 146:1995;247-262.
- (1995) Discrete Math. , vol.146 , pp. 247-262
- West, J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.